default search action
Robert Janczewski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j21]Robert Janczewski, Krzysztof Turowski, Bartlomiej Wróblewski:
Edge coloring of graphs of signed class 1 and 2. Discret. Appl. Math. 338: 311-319 (2023) - [i2]Robert Janczewski, Krzysztof Turowski, Bartlomiej Wróblewski:
Edge coloring of products of signed graphs. CoRR abs/2312.02691 (2023) - 2022
- [j20]Robert Janczewski, Pawel Obszarski, Krzysztof Turowski, Bartlomiej Wróblewski:
Infinite chromatic games. Discret. Appl. Math. 309: 138-146 (2022) - [j19]Robert Janczewski, Pawel Obszarski, Krzysztof Turowski:
Weighted 2-sections and hypergraph reconstruction. Theor. Comput. Sci. 915: 11-25 (2022) - [i1]Robert Janczewski, Krzysztof Turowski, Bartlomiej Wróblewski:
Edge coloring of graphs of signed class 1 and 2. CoRR abs/2205.15425 (2022) - 2021
- [j18]Robert Janczewski, Anna Maria Trzaskowska, Krzysztof Turowski:
T-colorings, divisibility and circular chromatic number. Discuss. Math. Graph Theory 41(2): 441-450 (2021)
2010 – 2019
- 2019
- [j17]Robert Janczewski, Pawel Obszarski, Krzysztof Turowski:
2-Coloring number revisited. Theor. Comput. Sci. 796: 187-195 (2019) - 2018
- [j16]Robert Janczewski, Anna Malafiejska, Michal Malafiejski:
On incidence coloring of complete multipartite and semicubic bipartite graphs. Discuss. Math. Graph Theory 38(1): 107-119 (2018) - 2016
- [j15]Robert Janczewski, Krzysztof Turowski:
On the hardness of computing span of subcubic graphs. Inf. Process. Lett. 116(1): 26-32 (2016) - [j14]Robert Janczewski, Krzysztof Turowski:
An O(n log n) algorithm for finding edge span of cacti. J. Comb. Optim. 31(4): 1373-1382 (2016) - 2015
- [j13]Robert Janczewski, Anna Malafiejska, Michal Malafiejski:
Interval incidence graph coloring. Discret. Appl. Math. 182: 73-83 (2015) - [j12]Robert Janczewski, Krzysztof Turowski:
The computational complexity of the backbone coloring problem for planar graphs with connected backbones. Discret. Appl. Math. 184: 237-242 (2015) - [j11]Robert Janczewski, Krzysztof Turowski:
The Backbone Coloring Problem for Bipartite Backbones. Graphs Comb. 31(5): 1487-1496 (2015) - [j10]Robert Janczewski, Krzysztof Turowski:
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones. Inf. Process. Lett. 115(2): 232-236 (2015) - 2014
- [j9]Robert Janczewski, Anna Malafiejska, Michal Malafiejski:
Interval incidence coloring of bipartite graphs. Discret. Appl. Math. 166: 131-140 (2014) - 2011
- [j8]Damian Bogdanowicz, Krzysztof Giaro, Robert Janczewski:
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem. Theor. Comput. Sci. 412(35): 4721-4728 (2011)
2000 – 2009
- 2009
- [j7]Robert Janczewski:
Greedy T-colorings of graphs. Discret. Math. 309(6): 1685-1690 (2009) - [j6]Robert Janczewski, Adrian Kosowski, Michal Malafiejski:
The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree. Discret. Math. 309(10): 3270-3279 (2009) - [c2]Robert Janczewski, Anna Malafiejska, Michal Malafiejski:
Interval Wavelength Assignment in All-Optical Star Networks. PPAM (1) 2009: 11-20 - 2004
- [j5]Michal Malafiejski, Krzysztof Giaro, Robert Janczewski, Marek Kubale:
Sum Coloring of Bipartite Graphs with Bounded Degree. Algorithmica 40(4): 235-244 (2004) - 2003
- [j4]Krzysztof Giaro, Robert Janczewski, Michal Malafiejski:
The complexity of the T-coloring problem for graphs with small degree. Discret. Appl. Math. 129(2-3): 361-369 (2003) - [j3]Krzysztof Giaro, Robert Janczewski, Michal Malafiejski:
A polynomial algorithm for finding T-span of generalized cacti. Discret. Appl. Math. 129(2-3): 371-382 (2003) - 2002
- [c1]Krzysztof Giaro, Robert Janczewski, Marek Kubale, Michal Malafiejski:
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs. APPROX 2002: 135-145 - 2001
- [j2]Robert Janczewski:
Divisibility and T-span of graphs. Discret. Math. 234(1-3): 171-179 (2001) - [j1]Robert Janczewski, Marek Kubale, Krzysztof Manuszewski, Konrad Piwakowski:
The smallest hard-to-color graph for algorithm DSATUR. Discret. Math. 236(1-3): 151-165 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint