default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Kratochvíl
Person information
- affiliation: Charles University, Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j109]Jan Bok
, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski:
List Covering of Regular Multigraphs with Semi-edges. Algorithmica 86(3): 782-807 (2024)- [j108]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational complexity of covering disconnected multigraphs. Discret. Appl. Math. 359: 229-243 (2024) - [j107]Jan Kratochvíl, Martin Loebl, Jaroslav Nesetril:
Preface: Czech-Slovak Graph Theory in honor of Robin Thomas. Discret. Math. 347(9): 114066 (2024) - [c93]Therese Biedl, Sabine Cornelsen, Jan Kratochvíl, Ignaz Rutter:
Constrained Outer-String Representations. GD 2024: 10:1-10:18 - [c92]Joakim Sunde, Brigt Arve Toppe Håvardstun, Jan Kratochvíl, Jan Arne Telle:
On a Combinatorial Problem Arising in Machine Teaching. ICML 2024 - [c91]Nikola Jedlicková, Jan Kratochvíl:
On the Structure of Hamiltonian Graphs with Small Independence Number. IWOCA 2024: 180-192 - [i30]Brigt Arve Toppe Håvardstun, Jan Kratochvíl, Joakim Sunde, Jan Arne Telle:
On a Combinatorial Problem Arising in Machine Teaching. CoRR abs/2402.04907 (2024) - [i29]Nikola Jedlicková, Jan Kratochvíl:
On the Structure of Hamiltonian Graphs with Small Independence Number. CoRR abs/2403.03668 (2024) - 2023
- [j106]Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter:
Drawing Simultaneously Embedded Graphs with Few Bends. Int. J. Found. Comput. Sci. 34(7): 807-824 (2023) - [c90]Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff:
The Parametrized Complexity of the Segment Number. GD (2) 2023: 97-113 - [c89]Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr:
Three Edge-Disjoint Plane Spanning Paths in a Point Set. GD (1) 2023: 323-338 - [c88]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 - [c87]Jan Kratochvíl:
Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult. WALCOM 2023: 3-11 - [c86]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract). WG 2023: 101-115 - [i28]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational Complexity of Covering Disconnected Multigraphs. CoRR abs/2306.06431 (2023) - [i27]Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr:
Three Edge-disjoint Plane Spanning Paths in a Point Set. CoRR abs/2306.07237 (2023) - [i26]Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff:
The Parametrized Complexity of the Segment Number. CoRR abs/2308.15416 (2023) - [i25]Nikola Jedlicková, Jan Kratochvíl:
Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number. CoRR abs/2309.09228 (2023) - 2022
- [j105]Robert Ganian, Jan Kratochvíl, Stefan Szeider:
Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria. Discret. Appl. Math. 312: 1-2 (2022) - [c85]Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter:
The Rique-Number of Graphs. GD 2022: 371-386 - [c84]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski:
List Covering of Regular Multigraphs. IWOCA 2022: 228-242 - [i24]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski:
List covering of regular multigraphs. CoRR abs/2204.04280 (2022) - [i23]Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter:
The Rique-Number of Graphs. CoRR abs/2209.00424 (2022) - [i22]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
- [j104]Jan Kratochvíl, Tomás Masarík, Jana Novotná:
U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. Algorithmica 83(12): 3649-3680 (2021) - [j103]Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr:
The Stub Resolution of 1-planar Graphs. J. Graph Algorithms Appl. 25(2): 625-642 (2021) - [c83]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational Complexity of Covering Disconnected Multigraphs. FCT 2021: 85-99 - [c82]Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl:
Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. MFCS 2021: 21:1-21:15 - [i21]Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl:
Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges. CoRR abs/2103.15214 (2021) - 2020
- [c81]Jan Kratochvíl, Tomás Masarík, Jana Novotná:
U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. MFCS 2020: 57:1-57:14 - [c80]Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr:
The Stub Resolution of 1-Planar Graphs. WALCOM 2020: 170-182 - [i20]Jan Kratochvíl, Tomás Masarík, Jana Novotná:
U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited. CoRR abs/2002.08311 (2020)
2010 – 2019
- 2019
- [j102]Dariusz Dereniowski, Tomas Gavenciak, Jan Kratochvíl:
Cops, a fast robber and defensive domination on interval graphs. Theor. Comput. Sci. 794: 47-58 (2019) - 2018
- [j101]Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar:
Homothetic polygons and beyond: Maximal cliques in intersection graphs. Discret. Appl. Math. 247: 263-277 (2018) - [j100]Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl:
Parameterized complexity of distance labeling and uniform channel assignment problems. Discret. Appl. Math. 248: 46-55 (2018) - [j99]Jan Kratochvíl, Zsuzsanna Lipták:
Preface. Eur. J. Comb. 68: 1-2 (2018) - [j98]Tomas Gavenciak, Przemyslaw Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl:
Cops and Robbers on intersection graphs. Eur. J. Comb. 72: 45-69 (2018) - [j97]Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela:
3-connected reduction for regular graph covers. Eur. J. Comb. 73: 170-210 (2018) - [j96]Alexandre Talon, Jan Kratochvíl:
Completion of the mixed unit interval graphs hierarchy. J. Graph Theory 87(3): 317-332 (2018) - [c79]Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr:
Bounded Stub Resolution for Some Maximal 1-Planar Graphs. CALDAM 2018: 214-220 - 2017
- [j95]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil:
Extending Partial Representations of Proper and Unit Interval Graphs. Algorithmica 77(4): 1071-1104 (2017) - [j94]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil:
Extending Partial Representations of Interval Graphs. Algorithmica 78(3): 945-967 (2017) - [j93]Carla Binucci, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvíl, Fabrizio Montecchiani, Ioannis G. Tollis:
Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus. J. Graph Algorithms Appl. 21(1): 81-102 (2017) - [j92]James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil:
MSOL restricted contractibility to planar graphs. Theor. Comput. Sci. 676: 1-14 (2017) - [c78]Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jaroslav Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr:
On Vertex- and Empty-Ply Proximity Drawings. GD 2017: 24-37 - [i19]Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jan Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr:
On Vertex- and Empty-Ply Proximity Drawings. CoRR abs/1708.09233 (2017) - 2016
- [j91]Jan Kratochvíl, Jan Arne Telle, Marek Tesar:
Computational complexity of covering three-vertex multigraphs. Theor. Comput. Sci. 609: 104-117 (2016) - [c77]Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl:
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract). COCOON 2016: 67-78 - [c76]Vít Jelínek, Eva Jelínková, Jan Kratochvíl:
On the Hardness of Switching to a Small Number of Edges. COCOON 2016: 159-170 - [c75]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter:
Simultaneous Orthogonal Planarity. GD 2016: 532-545 - [i18]Vít Jelínek, Eva Jelínková, Jan Kratochvíl:
On the hardness of switching to a small number of edges. CoRR abs/1603.00254 (2016) - [i17]Tomas Gavenciak, Przemyslaw Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl:
Cops and Robbers on Intersection Graphs. CoRR abs/1607.08058 (2016) - [i16]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter:
Simultaneous Orthogonal Planarity. CoRR abs/1608.08427 (2016) - [i15]Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela:
Algorithmic Aspects of Regular Graph Covers. CoRR abs/1609.03013 (2016) - 2015
- [j90]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter:
Testing Planarity of Partially Embedded Graphs. ACM Trans. Algorithms 11(4): 32:1-32:42 (2015) - [j89]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh:
Extending partial representations of subclasses of chordal graphs. Theor. Comput. Sci. 576: 85-101 (2015) - [c74]Carla Binucci, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvíl, Fabrizio Montecchiani, Ioannis G. Tollis:
2-Layer Fan-Planarity: From Caterpillar to Stegosaurus. GD 2015: 281-294 - [c73]Tomas Gavenciak, Przemyslaw Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl:
Cops and Robbers on String Graphs. ISAAC 2015: 355-366 - [c72]Alexandre Talon, Jan Kratochvíl:
Completion of the Mixed Unit Interval Graphs Hierarchy. TAMC 2015: 284-296 - [e7]Jan Kratochvíl, Mirka Miller, Dalibor Froncek:
Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8986, Springer 2015, ISBN 978-3-319-19314-4 [contents] - [i14]Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl:
Distance constrained labeling on graphs with bounded neighborhood diversity. CoRR abs/1507.00640 (2015) - 2014
- [j88]Pinar Heggernes, Jan Kratochvíl, Sang-il Oum:
Guest editors' foreword. Discret. Appl. Math. 168: 1-2 (2014) - [j87]Jan Kratochvíl, Mark H. Siggers:
Locally injective k-colourings of planar graphs. Discret. Appl. Math. 173: 53-61 (2014) - [j86]Tomas Gavenciak, Jan Kratochvíl, Pawel Pralat:
Firefighting on square, hexagonal, and triangular grids. Discret. Math. 337: 142-155 (2014) - [j85]Eva Jelínková, Jan Kratochvíl:
On Switching to H-Free Graphs. J. Graph Theory 75(4): 387-405 (2014) - [c71]Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter:
Drawing Simultaneously Embedded Graphs with Few Bends. GD 2014: 40-51 - [c70]Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela:
Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs. ICALP (1) 2014: 489-501 - [c69]Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter:
Planar Embeddings with Small and Uniform Faces. ISAAC 2014: 633-645 - [c68]Jan Kratochvíl, Jan Arne Telle, Marek Tesar:
Computational Complexity of Covering Three-Vertex Multigraphs. MFCS (2) 2014: 493-504 - [c67]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil:
Extending Partial Representations of Proper and Unit Interval Graphs. SWAT 2014: 253-264 - [c66]Steven Chaplick, Paul Dorbec, Jan Kratochvíl, Mickaël Montassier, Juraj Stacho:
Contact Representations of Planar Graphs: Extending a Partial Representation is Hard. WG 2014: 139-151 - [i13]Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela:
Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs. CoRR abs/1402.3774 (2014) - [i12]Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter:
Planar Embeddings with Small and Uniform Faces. CoRR abs/1409.4299 (2014) - [i11]Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar:
Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique. CoRR abs/1411.2928 (2014) - [i10]Alexandre Talon, Jan Kratochvíl:
Completion of the mixed unit interval graphs hierarchy. CoRR abs/1412.0540 (2014) - 2013
- [j84]Vít Jelínek, Jan Kratochvíl, Ignaz Rutter:
A Kuratowski-type theorem for planarity of partially embedded graphs. Comput. Geom. 46(4): 466-492 (2013) - [j83]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski:
Determining the L(2, 1)L(2, 1)-span in polynomial space. Discret. Appl. Math. 161(13-14): 2052-2061 (2013) - [j82]Jan Kratochvíl, Mirka Miller:
Preface. Eur. J. Comb. 34(1): 1-2 (2013) - [j81]Jan Kratochvíl, Mirka Miller:
Preface. Eur. J. Comb. 34(3): 539-540 (2013) - [j80]Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil:
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. Graphs Comb. 29(4): 981-1005 (2013) - [j79]Jirí Fiala, Jan Kratochvíl, Angsheng Li:
Preface. Theor. Comput. Sci. 494: 1 (2013) - [j78]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski:
Fast exact algorithm for L(2, 1)-labeling of graphs. Theor. Comput. Sci. 505: 42-54 (2013) - [c65]Tomas Gavenciak, Vít Jelínek, Pavel Klavík, Jan Kratochvíl:
Cops and Robbers on Intersection Graphs. ISAAC 2013: 174-184 - [c64]Jan Kratochvíl, Torsten Ueckerdt:
Non-crossing Connectors in the Plane. TAMC 2013: 108-120 - [i9]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil:
Linear-time Algorithm for Partial Representation Extension of Interval Graphs. CoRR abs/1306.2182 (2013) - 2012
- [j77]Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski:
Guest editors' foreword. Discret. Appl. Math. 160(6): 683-684 (2012) - [j76]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma:
Distance three labelings of trees. Discret. Appl. Math. 160(6): 764-779 (2012) - [j75]Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý:
Parameterized complexity of generalized domination problems. Discret. Appl. Math. 160(6): 780-792 (2012) - [j74]Mathew C. Francis, Jan Kratochvíl, Tomás Vyskocil:
Segment representation of a subclass of co-planar graphs. Discret. Math. 312(10): 1815-1818 (2012) - [c63]Pavel Klavík, Jan Kratochvíl, Tomasz Krawczyk, Bartosz Walczak:
Extending Partial Representations of Function Graphs and Permutation Graphs. ESA 2012: 671-682 - [c62]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh:
Extending Partial Representations of Subclasses of Chordal Graphs. ISAAC 2012: 444-454 - [c61]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski:
Beyond Homothetic Polygons: Recognition and Maximum Clique. ISAAC 2012: 619-628 - [c60]James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil:
MSOL Restricted Contractibility to Planar Graphs. IPEC 2012: 194-205 - [c59]Martin Doucha, Jan Kratochvíl:
Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width. MFCS 2012: 348-359 - [c58]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski:
Determining the L(2, 1)-Span in Polynomial Space. WG 2012: 126-137 - [c57]Steven Chaplick, Vít Jelínek, Jan Kratochvíl, Tomás Vyskocil:
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill. WG 2012: 274-285 - [i8]Jan Kratochvíl, Torsten Ueckerdt:
Non-crossing Connectors in the Plane. CoRR abs/1201.0917 (2012) - [i7]Vít Jelínek, Jan Kratochvíl, Ignaz Rutter:
A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs. CoRR abs/1204.2915 (2012) - [i6]James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil:
Matching and l-Subgraph Contractibility to Planar Graphs. CoRR abs/1204.6070 (2012) - [i5]Pavel Klavík, Jan Kratochvíl, Tomasz Krawczyk, Bartosz Walczak:
Extending partial representations of function graphs and permutation graphs. CoRR abs/1204.6391 (2012) - [i4]Steven Chaplick, Vít Jelínek, Jan Kratochvíl, Tomás Vyskocil:
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill. CoRR abs/1206.5159 (2012) - [i3]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh:
Extending Partial Representations of Subclasses of Chordal Graphs. CoRR abs/1207.0255 (2012) - [i2]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil:
Extending Partial Representations of Proper and Unit Interval Graphs. CoRR abs/1207.6960 (2012) - [i1]Jan Kratochvíl, Michal Vaner:
A note on planar partial 3-trees. CoRR abs/1210.8113 (2012) - 2011
- [j73]Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Exact Algorithms for L(2, 1)-Labeling of Graphs. Algorithmica 59(2): 169-194 (2011) - [j72]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Branch and Recharge: Exact Algorithms for Generalized Domination. Algorithmica 61(2): 252-273 (2011) - [j71]Eva Jelínková, Ondrej Suchý, Petr Hlinený, Jan Kratochvíl:
Parameterized Problems Related to Seidel's Switching. Discret. Math. Theor. Comput. Sci. 13(2): 19-44 (2011) - [j70]Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle:
On the complexity of reconstructing H-free graphs from their Star Systems. J. Graph Theory 68(2): 113-124 (2011) - [j69]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Parameterized complexity of coloring problems: Treewidth versus vertex cover. Theor. Comput. Sci. 412(23): 2513-2523 (2011) - [c56]Jan Kratochvíl:
Can they cross? and how?: (the hitchhiker's guide to the universe of geometric intersection graphs). SCG 2011: 75-76 - [c55]Vít Jelínek, Jan Kratochvíl, Ignaz Rutter:
A kuratowski-type theorem for planarity of partially embedded graphs. SCG 2011: 107-116 - [c54]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski:
Fast Exact Algorithm for L(2, 1)-Labeling of Graphs. TAMC 2011: 82-93 - [c53]Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil:
Extending Partial Representations of Interval Graphs. TAMC 2011: 276-285 - [e6]Petr Kolman, Jan Kratochvíl:
Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers. Lecture Notes in Computer Science 6986, Springer 2011, ISBN 978-3-642-25869-5 [contents] - 2010
- [j68]Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski:
Guest Editors' Foreword. Discret. Appl. Math. 158(7): 729-730 (2010) - [j67]Jan Kratochvíl, Jaroslav Nesetril, Zdenek Ryjácek:
Preface. Discret. Math. 310(3): 371-372 (2010) - [j66]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Nicolas Nisse, Karol Suchan:
Pursuing a fast robber on a graph. Theor. Comput. Sci. 411(7-9): 1167-1181 (2010) - [c52]Boris Horvat, Jan Kratochvíl, Tomaz Pisanski:
On the Computational Complexity of Degenerate Unit Distance Representations of Graphs. IWOCA 2010: 274-285 - [c51]