default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomasz Krawczyk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j24]James Davies, Tomasz Krawczyk, Rose McCarty
, Bartosz Walczak:
Grounded L-Graphs Are Polynomially χ-Bounded. Discret. Comput. Geom. 70(4): 1523-1550 (2023)- [j23]James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak:
Coloring polygon visibility graphs and their generalizations. J. Comb. Theory B 161: 268-300 (2023) - 2022
- [j22]Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa:
Vertex Deletion into Bipartite Permutation Graphs. Algorithmica 84(8): 2271-2291 (2022) - 2021
- [j21]Bartlomiej Bosek, Tomasz Krawczyk:
On-line partitioning of width w posets into wO(loglogw) chains. Eur. J. Comb. 91: 103202 (2021) - 2018
- [j20]Steven Chaplick, Grzegorz Guspiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta:
The Partial Visibility Representation Extension Problem. Algorithmica 80(8): 2286-2323 (2018) - [j19]Bartlomiej Bosek, Hal A. Kierstead, Tomasz Krawczyk, Grzegorz Matecki, Matthew E. Smith:
An Easy Subexponential Bound for Online Chain Partitioning. Electron. J. Comb. 25(2): 2 (2018) - [j18]Grzegorz Gutowski, Ming Han, Tomasz Krawczyk, Xuding Zhu:
Defective 3-Paintability of Planar Graphs. Electron. J. Comb. 25(2): 2 (2018) - 2017
- [j17]Tomasz Krawczyk, Bartosz Walczak:
On-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations. Comb. 37(6): 1139-1179 (2017) - 2015
- [j16]Bartlomiej Bosek, Tomasz Krawczyk:
A subexponential upper bound for the on-line chain partitioning problem. Comb. 35(1): 1-38 (2015) - [j15]Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak:
Coloring Triangle-Free Rectangle Overlap Graphs with $$O(\log \log n)$$ O ( log log n ) Colors. Discret. Comput. Geom. 53(1): 199-220 (2015) - [j14]Tomasz Krawczyk, Bartosz Walczak:
Asymmetric Coloring Games on Incomparability Graphs. Electron. Notes Discret. Math. 49: 803-811 (2015) - 2014
- [j13]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-free intersection graphs of line segments with large chromatic number. J. Comb. Theory B 105: 6-10 (2014) - 2013
- [j12]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-Free Geometric Intersection Graphs with Large Chromatic Number. Discret. Comput. Geom. 50(3): 714-726 (2013) - [j11]Stefan Felsner, Tomasz Krawczyk, William T. Trotter:
On-Line Dimension for Posets Excluding Two Long Incomparable Chains. Order 30(1): 1-12 (2013) - [j10]Bartlomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek:
On-Line Dimension of Semi-Orders. Order 30(2): 593-615 (2013) - [j9]Bartlomiej Bosek, Tomasz Krawczyk, Grzegorz Matecki:
First-Fit Coloring of Incomparability Graphs. SIAM J. Discret. Math. 27(1): 126-140 (2013) - 2012
- [j8]Bartlomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek:
On-line version of Rabinovitch theorem for proper intervals. Discret. Math. 312(23): 3426-3436 (2012) - [j7]Bartlomiej Bosek, Stefan Felsner, Kamil Kloch, Tomasz Krawczyk, Grzegorz Matecki, Piotr Micek:
On-Line Chain Partitions of Orders: A Survey. Order 29(1): 49-73 (2012) - 2011
- [j6]Bartlomiej Bosek, Tomasz Krawczyk, Grzegorz Matecki:
Forbidden structures for efficient First-Fit chain partitioning (extended abstract). Electron. Notes Discret. Math. 38: 173-179 (2011) - 2010
- [j5]Bartlomiej Bosek, Tomasz Krawczyk, Edward Szczypka:
First-Fit Algorithm for the On-Line Chain Partitioning Problem. SIAM J. Discret. Math. 23(4): 1992-1999 (2010) - 2006
- [j4]Wit Forys, Tomasz Krawczyk:
An algorithmic approach to the problem of a semiretract base. Theor. Comput. Sci. 369(1-3): 314-322 (2006) - 2003
- [j3]Wit Forys, Tomasz Krawczyk, James A. Anderson:
Semiretracts--a counterexample and some results. Theor. Comput. Sci. 307(1): 117-127 (2003) - 1980
- [j2]Tomasz Krawczyk:
Error Correction by Mutational Grammars. Inf. Process. Lett. 11(1): 9-15 (1980) - 1975
- [j1]Stanislaw Jarzabek, Tomasz Krawczyk:
LL-Regular Grammars. Inf. Process. Lett. 4(2): 31-37 (1975)
Conference and Workshop Papers
- 2023
- [c9]Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman:
Recognizing H-Graphs - Beyond Circular-Arc Graphs. MFCS 2023: 8:1-8:14 - 2021
- [c8]James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak:
Colouring Polygon Visibility Graphs and Their Generalizations. SoCG 2021: 29:1-29:16 - 2020
- [c7]Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa:
Vertex Deletion into Bipartite Permutation Graphs. IPEC 2020: 5:1-5:16 - 2017
- [c6]Tomasz Krawczyk, Bartosz Walczak:
Extending Partial Representations of Trapezoid Graphs. WG 2017: 358-371 - 2016
- [c5]Steven Chaplick, Grzegorz Guspiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta:
The Partial Visibility Representation Extension Problem. GD 2016: 266-279 - 2014
- [c4]Tomasz Krawczyk, Bartosz Walczak:
Coloring Relatives of Interval Overlap Graphs via On-line Games. ICALP (1) 2014: 738-750 - 2013
- [c3]Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak:
Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors. WG 2013: 333-344 - 2012
- [c2]Pavel Klavík, Jan Kratochvíl, Tomasz Krawczyk, Bartosz Walczak:
Extending Partial Representations of Function Graphs and Permutation Graphs. ESA 2012: 671-682 - 2010
- [c1]Bartlomiej Bosek, Tomasz Krawczyk:
The Sub-exponential Upper Bound for On-Line Chain Partitioning. FOCS 2010: 347-354
Informal and Other Publications
- 2024
- [i18]Yixin Cao, Jan Derbisz, Tomasz Krawczyk:
Characterization of Chordal Circular-arc Graphs: I. Split Graphs. CoRR abs/2403.01947 (2024) - [i17]Jan Derbisz, Tomasz Krawczyk:
Circular-arc graphs and the Helly property. CoRR abs/2404.00416 (2024) - [i16]Yixin Cao, Tomasz Krawczyk:
Characterization of Circular-arc Graphs: II. McConnell Flipping. CoRR abs/2408.10892 (2024) - [i15]Yixin Cao, Tomasz Krawczyk:
Characterization of Circular-arc Graphs: III. Chordal Graphs. CoRR abs/2409.02733 (2024) - 2022
- [i14]Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman:
Beyond circular-arc graphs - recognizing lollipop graphs and medusa graphs. CoRR abs/2212.05433 (2022) - 2021
- [i13]James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak:
Colouring polygon visibility graphs and their generalizations. CoRR abs/2103.07803 (2021) - [i12]James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak:
Grounded L-graphs are polynomially χ-bounded. CoRR abs/2108.05611 (2021) - 2020
- [i11]Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa:
Vertex deletion into bipartite permutation graphs. CoRR abs/2010.11440 (2020) - 2019
- [i10]Tomasz Krawczyk:
Testing isomorphism of circular-arc graphs - Hsu's approach revisited. CoRR abs/1904.04501 (2019) - 2018
- [i9]Bartlomiej Bosek, Tomasz Krawczyk:
On-line partitioning of width w posets into w^O(log log w) chains. CoRR abs/1810.00270 (2018) - 2015
- [i8]Tomasz Krawczyk, Bartosz Walczak:
Asymmetric coloring games on incomparability graphs. CoRR abs/1503.04748 (2015) - [i7]Steven Chaplick, Grzegorz Guspiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta:
The Partial Visibility Representation Extension Problem. CoRR abs/1512.00174 (2015) - 2014
- [i6]Tomasz Krawczyk, Bartosz Walczak:
Coloring relatives of interval overlap graphs via on-line games. CoRR abs/1402.2437 (2014) - [i5]Bartlomiej Bosek, Hal A. Kierstead, Tomasz Krawczyk, Grzegorz Matecki, Matthew E. Smith:
An Improved Subexponential Bound for On-line Chain Partitioning. CoRR abs/1410.3247 (2014) - 2013
- [i4]Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak:
Coloring triangle-free rectangular frame intersection graphs with O(log log n) colors. CoRR abs/1301.0541 (2013) - 2012
- [i3]Pavel Klavík, Jan Kratochvíl, Tomasz Krawczyk, Bartosz Walczak:
Extending partial representations of function graphs and permutation graphs. CoRR abs/1204.6391 (2012) - [i2]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-free intersection graphs of line segments with large chromatic number. CoRR abs/1209.1595 (2012) - [i1]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-free geometric intersection graphs with large chromatic number. CoRR abs/1212.2058 (2012)
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-10-22 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
