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
Journal Articles
- 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) - 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) - 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) - 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) - 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) - 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) - 2016
- [j91]Jan Kratochvíl, Jan Arne Telle, Marek Tesar:
Computational complexity of covering three-vertex multigraphs. Theor. Comput. Sci. 609: 104-117 (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) - 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) - 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) - 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) - 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) - 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) - 2009
- [j65]Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra:
Guest editors' foreword. Discret. Appl. Math. 157(12): 2575-2576 (2009) - [j64]Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff:
Untangling a Planar Graph. Discret. Comput. Geom. 42(4): 542-569 (2009) - [j63]Anthony Bonato, Petr A. Golovach, Gena Hahn, Jan Kratochvíl:
The capture time of a graph. Discret. Math. 309(18): 5588-5595 (2009) - [j62]Mitre Costa Dourado, John G. Gimbel, Jan Kratochvíl, Fábio Protti, Jayme Luiz Szwarcfiter:
On the computation of the hull number of a graph. Discret. Math. 309(18): 5668-5674 (2009) - [j61]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Sort and Search: Exact algorithms for generalized domination. Inf. Process. Lett. 109(14): 795-798 (2009) - [j60]Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil:
Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs. J. Graph Algorithms Appl. 13(3): 379-422 (2009) - 2008
- [j59]Jirí Fiala, Jan Kratochvíl:
Locally constrained graph homomorphisms - structure, complexity, and applications. Comput. Sci. Rev. 2(2): 97-111 (2008) - [j58]Jirí Fiala, Jan Kratochvíl, Attila Pór:
On the computational complexity of partial covers of Theta graphs. Discret. Appl. Math. 156(7): 1143-1149 (2008) - [j57]Jan Kratochvíl, Martin Pergel:
Intersection graphs of homothetic polygons. Electron. Notes Discret. Math. 31: 277-280 (2008) - 2007
- [j56]Jan Kratochvíl, Josep Díaz, Jirí Fiala:
Editorial. Discret. Appl. Math. 155(2): 79-80 (2007) - [j55]Jan Kára, Jan Kratochvíl, David R. Wood:
On the Complexity of the Balanced Vertex Ordering Problem. Discret. Math. Theor. Comput. Sci. 9(1) (2007) - [j54]Petr Hlinený, Jan Kratochvíl, Roman Nedela, Martin Skoviera:
Preface. Electron. Notes Discret. Math. 28: 1 (2007) - [j53]Vojtech Minárik, Jan Kratochvíl:
Dislocation dynamics - analytical description of the interaction force between dipolar loops. Kybernetika 43(6): 841-854 (2007) - 2006
- [j52]Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger:
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. Algorithmica 44(4): 343-361 (2006) - [j51]Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss:
Coloring mixed hypertrees. Discret. Appl. Math. 154(4): 660-672 (2006) - 2005
- [j50]Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra:
Structural decompositions, width parameters, and graph labelings. Discret. Appl. Math. 145(2): 141-142 (2005) - [j49]Ton Kloks, Jan Kratochvíl, Haiko Müller:
Computing the branchwidth of interval graphs. Discret. Appl. Math. 145(2): 266-275 (2005) - [j48]Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski:
Systems of distant representatives. Discret. Appl. Math. 145(2): 306-316 (2005) - [j47]Jirí Fiala, Jan Kratochvíl, Attila Pór:
On the computational complexity of partial covers of Theta graphs. Electron. Notes Discret. Math. 19: 79-85 (2005) - [j46]Václav Koubek, Jan Kratochvíl:
Preface. Theor. Comput. Sci. 345(2-3): 171-172 (2005) - 2004
- [j45]Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss:
Mixed hypercacti. Discret. Math. 286(1-2): 99-113 (2004) - 2003
- [j44]Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss:
Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. Theor. Comput. Sci. 295: 263-278 (2003) - 2002
- [j43]Gena Hahn, Jan Kratochvíl, Jozef Sirán, Dominique Sotteau:
On the injective chromatic number of graphs. Discret. Math. 256(1-2): 179-192 (2002) - [j42]Jirí Fiala, Jan Kratochvíl:
Partial covers of graphs. Discuss. Math. Graph Theory 22(1): 89-99 (2002) - [j41]Jan Kratochvíl, Zsolt Tuza:
On the complexity of bicoloring clique hypergraphs of graphs. J. Algorithms 45(1): 40-54 (2002) - [j40]Hubert de Fraysseix, Jan Kratochvíl:
Guest Editors' Foreword. J. Graph Algorithms Appl. 6(1): 3-5 (2002) - 2001
- [j39]Jirí Fiala, Ton Kloks, Jan Kratochvíl:
Fixed-parameter complexity of lambda-labelings. Discret. Appl. Math. 113(1): 59-72 (2001) - [j38]Miroslav Fiedler, Jan Kratochvíl, Jaroslav Nesetril:
DIMATIA surveys (related to the Fifth Czech and Slovak Symposium on Combinatorics, Graph Theory, Algorithms and Applications held in Prague on July 6-11, 1998). Discret. Math. 229(1-3): 1-2 (2001) - [j37]Petr Hlinený, Jan Kratochvíl:
Representing graphs by disks and balls (a survey of recognition-complexity results). Discret. Math. 229(1-3): 101-124 (2001) - [j36]Miroslav Fiedler, Jan Kratochvíl, Jaroslav Nesetril:
Foreword. Discret. Math. 233(1-3): 1-2 (2001) - [j35]Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu:
Efficient algorithms for graphs with few P4's. Discret. Math. 235(1-3): 29-51 (2001) - 2000
- [j34]Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle:
Independent Sets with Domination Constraints. Discret. Appl. Math. 99(1-3): 39-54 (2000) - [j33]Jan Kratochvíl, Peter Mihók:
Hom-properties are uniquely factorizable into irreducible factors. Discret. Math. 213(1-3): 189-194 (2000) - [j32]Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle:
Mod-2 Independence and Domination in Graphs. Int. J. Found. Comput. Sci. 11(3): 355-363 (2000) - 1999
- [j31]Jan Kratochvíl, Zsolt Tuza:
Rankings of Directed Graphs. SIAM J. Discret. Math. 12(3): 374-384 (1999) - 1998
- [j30]Jan Kratochvíl, Paul D. Manuel, Mirka Miller, Andrzej Proskurowski:
Disjoint and unfolding domination in graphs. Australas. J Comb. 18: 277-292 (1998) - [j29]Jan Kratochvíl, Ales Kubena:
On intersection representations of co-planar graphs. Discret. Math. 178(1-3): 251-255 (1998) - [j28]Jan Kratochvíl, Zsolt Tuza, Margit Voigt:
Complexity of choosing subsets from color sets. Discret. Math. 191(1-3): 139-148 (1998) - [j27]Jan Kratochvíl, Zsolt Tuza, Margit Voigt:
Brooks-type theorems for choosability with separation. J. Graph Theory 27(1): 43-49 (1998) - [j26]Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle:
On the Complexity of Graph Covering Problems. Nord. J. Comput. 5(3): 173-195 (1998) - 1997
- [j25]Elias Dahlhaus, Jan Kratochvíl, Paul D. Manuel, Mirka Miller:
Transversal Partitioning in Balanced Hypergraphs. Discret. Appl. Math. 79(1-3): 75-89 (1997) - [j24]Alexandr V. Kostochka, Jan Kratochvíl:
Covering and coloring polygon-circle graphs. Discret. Math. 163(1-3): 299-305 (1997) - [j23]Jan Kratochvíl, Peter Mihók, Gabriel Semanisin:
Graphs maximal with respect to hom-properties. Discuss. Math. Graph Theory 17(1): 77-88 (1997) - [j22]Jan Kratochvíl, Ingo Schiermeyer:
On the computational complexity of (O, P)-partition problems. Discuss. Math. Graph Theory 17(2): 253-258 (1997) - [j21]Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle:
Covering Regular Graphs. J. Comb. Theory B 71(1): 1-16 (1997) - [j20]Jan Kratochvíl, András Sebö:
Coloring precolored perfect graphs. J. Graph Theory 25(3): 207-215 (1997) - 1995
- [j19]Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer:
The Complexity of Induced Minors and Related Problems. Algorithmica 13(3): 266-282 (1995) - [j18]Jan Kratochvíl, Paul D. Manuel, Mirka Miller:
Generalized Domination in Chordal Graphs. Nord. J. Comput. 2(1): 41-50 (1995) - 1994
- [j17]Jan Kratochvíl, Zsolt Tuza:
Algorithmic complexity of list colorings. Discret. Appl. Math. 50(3): 297-302 (1994) - [j16]Jan Kratochvíl:
A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness. Discret. Appl. Math. 52(3): 233-252 (1994) - [j15]Jan Kratochvíl:
Regular codes in regular graphs are difficult. Discret. Math. 133(1-3): 191-205 (1994) - [j14]Jan Kratochvíl, Zsolt Tuza:
Intersection Dimensions of Graph Classes. Graphs Comb. 10(2-4): 159-168 (1994) - [j13]Jan Kratochvíl, Jirí Matousek:
Intersection Graphs of Segments. J. Comb. Theory B 62(2): 289-315 (1994) - 1993
- [j12]Jan Kratochvíl, Mirko Krivánek:
Satisfiability of Co-Nested Formulas. Acta Informatica 30(4): 397-403 (1993) - [j11]Jan Kratochvíl, Petr Savický, Zsolt Tuza:
One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete. SIAM J. Comput. 22(1): 203-210 (1993) - 1992
- [j10]Jan Kratochvíl, Svatopluk Poljak:
Compatible 2-factors. Discret. Appl. Math. 36(3): 253-266 (1992) - [j9]Svante Janson, Jan Kratochvíl:
Thresholds for classes of intersection graphs. Discret. Math. 108(1-3): 307-326 (1992) - 1991
- [j8]Jan Kratochvíl:
String graphs. I. The number of critical nonstring graphs is infinite. J. Comb. Theory B 52(1): 53-66 (1991) - [j7]Jan Kratochvíl:
String graphs. II. recognizing string graphs is NP-hard. J. Comb. Theory B 52(1): 67-78 (1991) - [j6]Jan Kratochvíl, Jirí Matousek:
String graphs requiring exponential representations. J. Comb. Theory B 53(1): 1-4 (1991) - [j5]Svante Janson, Jan Kratochvíl:
Proportional Graphs. Random Struct. Algorithms 2(2): 209-224 (1991) - [j4]Jan Kratochvíl, Anna Lubiw, Jaroslav Nesetril:
Noncrossing Subgraphs in Topological Layouts. SIAM J. Discret. Math. 4(2): 223-244 (1991) - 1988
- [j3]Jan Kratochvíl, Dainis Zeps:
On the number of Hamiltonian cycles in triangulations. J. Graph Theory 12(2): 191-194 (1988) - [j2]Pavol Hell, David G. Kirkpatrick, Jan Kratochvíl, Igor Kríz:
On Restricted Two-Factors. SIAM J. Discret. Math. 1(4): 472-484 (1988) - 1986
- [j1]Jan Kratochvíl:
Perfect codes over graphs. J. Comb. Theory B 40(2): 224-228 (1986)
Conference and Workshop Papers
- 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 - 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 - 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 - 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 - 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 - 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
- [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 - 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 - 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 - 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 - 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 - 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 - 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 - 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]Michael D. Coury, Pavol Hell, Jan Kratochvíl, Tomás Vyskocil:
Faithful Representations of Graphs by Islands in the Extended Grid. LATIN 2010: 131-142 - [c50]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter:
Testing Planarity of Partially Embedded Graphs. SODA 2010: 202-221 - 2009
- [c49]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. GD 2009: 304-315 - [c48]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. TAMC 2009: 221-230 - [c47]Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý:
Parameterized Complexity of Generalized Domination Problems. WG 2009: 133-142 - 2008
- [c46]Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický:
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. GD 2008: 121-132 - [c45]Eva Jelínková, Jan Kratochvíl:
On Switching to H-Free Graphs. ICGT 2008: 379-395 - [c44]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). ICALP (1) 2008: 294-305 - [c43]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl:
On tractability of Cops and Robbers game. IFIP TCS 2008: 171-185 - [c42]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. LATIN 2008: 194-205 - [c41]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Distance Constrained Labelings of Trees. TAMC 2008: 125-135 - [c40]Petr A. Golovach, Jan Kratochvíl:
Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity. TAMC 2008: 182-191 - 2007
- [c39]Melanie Badent, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Stefan Felsner, Francesco Giordano, Jan Kratochvíl, Pietro Palladino, Maurizio Patrignani, Francesco Trotta:
Homothetic Triangle Contact Representations of Planar Graphs. CCCG 2007: 233-236 - [c38]Jan Kratochvíl, Martin Pergel:
Geometric Intersection Graphs: Do Short Cycles Help? COCOON 2007: 118-128 - [c37]Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff:
Moving Vertices to Make Drawings Plane. GD 2007: 101-112 - [c36]Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil:
Clustered Planarity: Small Clusters in Eulerian Graphs. GD 2007: 303-314 - [c35]Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Exact Algorithms for L (2, 1)-Labeling of Graphs. MFCS 2007: 513-524 - [c34]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Branch and Recharge: Exact Algorithms for Generalized Domination. WADS 2007: 507-518 - [c33]Petr A. Golovach, Jan Kratochvíl:
Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. WG 2007: 1-11 - 2006
- [c32]Jan Kára, Jan Kratochvíl:
Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs. IWPEC 2006: 166-174 - [c31]Michael Kaufmann, Jan Kratochvíl, Katharina Anna Lehmann, Amarendran Ramaswami Subramanian:
Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. SODA 2006: 832-841 - [c30]Jirí Fiala, Jan Kratochvíl:
Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. WG 2006: 15-26 - 2005
- [c29]Jan Kára, Jan Kratochvíl, David R. Wood:
On the Complexity of the Balanced Vertex Ordering Problem. COCOON 2005: 849-858 - [c28]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Distance Constrained Labelings of Graphs of Bounded Treewidth. ICALP 2005: 360-372 - [c27]Jirí Fiala, Jan Kratochvíl:
On the Computational Complexity of the L(2, 1)-Labeling Problem for Regular Graphs. ICTCS 2005: 228-236 - 2004
- [c26]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Elegant Distance Constrained Labelings of Trees. WG 2004: 58-67 - 2003
- [c25]Jan Kratochvíl, Martin Pergel:
Two Results on Intersection Graphs of Polygons. GD 2003: 59-70 - [c24]Jan Kratochvíl:
Complexity of Hypergraph Coloring and Seidel's Switching. WG 2003: 297-308 - 2002
- [c23]Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski:
Geometric Systems of Disjoint Representatives. GD 2002: 110-117 - [c22]Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger:
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. SWAT 2002: 160-169 - [c21]Jan Kratochvíl, Zsolt Tuza, Margit Voigt:
On the b-Chromatic Number of Graphs. WG 2002: 310-320 - 2001
- [c20]Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski:
Distance Constrained Labeling of Precolored Trees. ICTCS 2001: 285-292 - [c19]Jirí Fiala, Jan Kratochvíl:
Complexity of Partial Covers of Graphs. ISAAC 2001: 537-549 - [c18]Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss:
Complexity Note on Mixed Hypergraphs. MFCS 2001: 474-486 - [c17]Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger:
Complexity of Coloring Graphs without Forbidden Induced Subgraphs. WG 2001: 254-262 - 2000
- [c16]Jan Kratochvíl, Zsolt Tuza:
On the complexity of bicoloring clique hypergraphs of graphs (extended abstract). SODA 2000: 40-41 - [c15]Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss:
Coloring Mixed Hypertrees. WG 2000: 279-289 - 1999
- [c14]Ton Kloks, Jan Kratochvíl, Haiko Müller:
New Branchwidth Territories. STACS 1999: 173-183 - [c13]Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle:
Mod-2 Independence and Domination in Graphs. WG 1999: 101-109 - [c12]Jirí Fiala, Ton Kloks, Jan Kratochvíl:
Fixed-Parameter Complexity of lambda-Labelings. WG 1999: 350-363 - 1998
- [c11]Jan Kratochvíl:
Crossing Number of Abstract Topological Graphs. GD 1998: 238-245 - [c10]Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle:
Independent Sets with Domination Constraints. ICALP 1998: 176-187 - [c9]Jan Kratochvíl, Zsolt Tuza:
Rankings of Directed Graphs. WG 1998: 114-123 - 1997
- [c8]Jan Kratochvíl, Zsolt Tuza, Margit Voigt:
New trends in the theory of graph colorings: Choosability and list coloring. Contemporary Trends in Discrete Mathematics 1997: 183-197 - [c7]Petr Hlinený, Jan Kratochvíl:
Computational Complexity of the Krausz Dimension of Graphs. WG 1997: 214-228 - [c6]Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle:
Complexity of Colored Graph Covers I. Colored Directed Multigraphs. WG 1997: 242-257 - 1996
- [c5]Jan Kratochvíl:
Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane. GD 1996: 257-270 - 1995
- [c4]Jan Kratochvíl, Teresa M. Przytycka:
Grid Intersection and Box Intersection Graphs on Surfaces (Extended Abstract). GD 1995: 365-372 - 1994
- [c3]Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle:
Complexity of Graph Covering Problems. WG 1994: 93-105 - 1991
- [c2]Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer:
Induced minors and related problems. Graph Structure Theory 1991: 179-182 - 1988
- [c1]Jan Kratochvíl, Mirko Krivánek:
On the Computational Complexity of Codes in Graphs. MFCS 1988: 396-404
Editorship
- 2015
- [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] - 2011
- [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
- [e5]Jan Kratochvíl, Angsheng Li, Jirí Fiala, Petr Kolman:
Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings. Lecture Notes in Computer Science 6108, Springer 2010, ISBN 978-3-642-13561-3 [contents] - 2009
- [e4]Jirí Fiala, Jan Kratochvíl, Mirka Miller:
Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers. Lecture Notes in Computer Science 5874, Springer 2009, ISBN 978-3-642-10216-5 [contents] - 2004
- [e3]Jirí Fiala, Václav Koubek, Jan Kratochvíl:
Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings. Lecture Notes in Computer Science 3153, Springer 2004, ISBN 3-540-22823-3 [contents] - 1999
- [e2]Ronald L. Graham, Jan Kratochvíl, Jaroslav Nesetril, Fred S. Roberts:
Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, Proceedings of a DIMACS Workshop, Stirín Castle, Czech Republic, May 19-25, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 49, DIMACS/AMS 1999, ISBN 0-8218-0963-6 [contents] - [e1]Jan Kratochvíl:
Graph Drawing, 7th International Symposium, GD'99, Stirín Castle, Czech Republic, September 1999, Proceedings. Lecture Notes in Computer Science 1731, Springer 1999, ISBN 3-540-66904-3 [contents]
Informal and Other Publications
- 2024
- [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
- [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
- [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
- [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
- [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) - 2017
- [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
- [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
- [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
- [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
- [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
- [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)
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-30 21:34 CET 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:
