Petr Hlinený

	2012
73		Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Lower Bounds on the Complexity of MSO_1 Model-Checking. STACS 2012: 326-337
72		Petr Hlinený, Ondrej Moris: Dynamic Scope-Based Dijkstra's Algorithm CoRR abs/1201.2000: (2012)
71		Jakub Gajarský, Petr Hlinený: Deciding Graph MSO Properties: Has it all been told already? CoRR abs/1204.5194: (2012)
70		Petr Hlinený, Ondrej Moris: Detours in Scope-Based Route Planning CoRR abs/1205.4363: (2012)
69		Markus Chimani, Petr Hlinený, Petra Mutzel: Vertex insertion approximates the crossing number of apex graphs. Eur. J. Comb. 33(3): 326-335 (2012)
68		Petr Hlinený, Antonín Kucera: Preface. Theor. Comput. Sci. 417: 1 (2012)
	2011
67		Petr Hlinený, Ondrej Moris: Scope-Based Route Planning. ESA 2011: 445-456
66		Markus Chimani, Petr Hlinený: A Tighter Insertion-Based Approximation of the Crossing Number. ICALP (1) 2011: 122-134
65		Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek: How Not to Characterize Planar-Emulable Graphs. IWOCA 2011: 106-120
64		Petr Hlinený, Ondrej Moris: Generalized Maneuvers in Route Planning. MEMICS 2011: 155-166
63		Robert Ganian, Petr Hlinený, Jan Obdrzálek: Clique-width: When Hard Does Not Mean Impossible. STACS 2011: 404-415
62		Petr Hlinený, Ondrej Moris: Multi-Stage Improved Route Planning Approach: theoretical foundations CoRR abs/1101.3182: (2011)
61		Markus Chimani, Petr Hlinený: A Tighter Insertion-based Approximation of the Crossing Number CoRR abs/1104.5039: (2011)
60		Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek: How Not to Characterize Planar-emulable Graphs CoRR abs/1107.0176: (2011)
59		Petr Hlinený, Ondrej Moris: Generalized Maneuvers in Route Planning CoRR abs/1107.0798: (2011)
58		Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Lower Bounds on the Complexity of MSO1 Model-Checking CoRR abs/1109.5804: (2011)
57		Eva Jelínková, Ondrej Suchý, Petr Hlinený, Jan Kratochvíl: Parameterized Problems Related to Seidel's Switching. Discrete Mathematics & Theoretical Computer Science 13(2): 19-44 (2011)
	2010
56		Petr Hlinený, Antonín Kucera: Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings Springer 2010
55		Robert Ganian, Petr Hlinený, Jan Obdrzálek: Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. FSTTCS 2010: 73-83
54		Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Are There Any Good Digraph Width Measures? IPEC 2010: 135-146
53		Petr Hlinený, Markus Chimani: Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. SODA 2010: 918-927
52		Robert Ganian, Petr Hlinený: New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes. SOFSEM 2010: 428-439
51		Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Are there any good digraph width measures? CoRR abs/1004.1485: (2010)
50		Robert Ganian, Petr Hlinený, Jan Obdrzálek: Better algorithms for satisfiability problems for formulas of bounded rank-width CoRR abs/1006.5621: (2010)
49		Robert Ganian, Petr Hlinený: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Discrete Applied Mathematics 158(7): 851-867 (2010)
48		Petr Hlinený: 20 Years of Negami's Planar Cover Conjecture. Graphs and Combinatorics 26(4): 525-536 (2010)
47		Petr Hlinený, Gelasio Salazar: Stars and bonds in crossing-critical graphs. Journal of Graph Theory 65(3): 198-215 (2010)
	2009
46		Petr Hlinený, Václav Matyás, Tomás Vojnar: Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2009, November 13-15, 2009, Prestige Hotel, Znojmo, Czech Republic Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2009
45		Robert Ganian, Petr Hlinený: Better Polynomial Algorithms on Graphs of Bounded Rank-Width. IWOCA 2009: 266-277
44		Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith: On Digraph Width Measures in Parameterized Algorithmics. IWPEC 2009: 185-197
43		Petr Hlinený, Václav Matyás, Tomás Vojnar: Preface -- Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). MEMICS 2009
42		Petr Hlinený, Geoff Whittle: Addendum to matroid tree-width. Eur. J. Comb. 30(4): 1036-1044 (2009)
	2008
41		Markus Chimani, Petr Hlinený, Petra Mutzel: Approximating the Crossing Number of Apex Graphs. Graph Drawing 2008: 432-434
40		Petr Hlinený, Robert Ganian: Automata approach to graphs of bounded rank-width. IWOCA 2008: 4-15
39		Petr Hlinený, Sang-il Oum, Detlef Seese, Georg Gottlob: Width Parameters Beyond Tree-width and their Applications. Comput. J. 51(3): 326-362 (2008)
38		Petr Hlinený: New Infinite Families of Almost-Planar Crossing-Critical Graphs. Electr. J. Comb. 15(1): (2008)
37		Isidoro Gitler, Petr Hlinený, Jesús Leaños, Gelasio Salazar: The Crossing Number of a Projective Graph is Quadratic in the Face-Width. Electr. J. Comb. 15(1): (2008)
36		Petr Hlinený, Gelasio Salazar: Stars and Bonds in Crossing-Critical Graphs. Electronic Notes in Discrete Mathematics 31: 271-275 (2008)
35		Petr Hlinený, Sang-il Oum: Finding Branch-Decompositions and Rank-Decompositions. SIAM J. Comput. 38(3): 1012-1032 (2008)
	2007
34		Petr Hlinený, Sang-il Oum: Finding Branch-Decompositions and Rank-Decompositions. ESA 2007: 163-174
33		Petr Hlinený, Gelasio Salazar: Approximating the Crossing Number of Toroidal Graphs. ISAAC 2007: 148-159
32		Petr Hlinený, Jan Kratochvíl, Roman Nedela, Martin Skoviera: Preface. Electronic Notes in Discrete Mathematics 28: 1 (2007)
31		Isidoro Gitler, Petr Hlinený, Jesús Leaños, Gelasio Salazar: The crossing number of a projective graph is quadratic in the face-width. Electronic Notes in Discrete Mathematics 29: 219-223 (2007)
30		Petr Hlinený: Some Hard Problems on Matroid Spikes. Theory Comput. Syst. 41(3): 551-562 (2007)
	2006
29		Petr Hlinený, Gelasio Salazar: On the Crossing Number of Almost Planar Graphs. Graph Drawing 2006: 162-173
28		Petr Hlinený: On Matroid Representability and Minor Problems. MFCS 2006: 505-516
27		Petr Hlinený: The Tutte Polynomial for Matroids of Bounded Branch-Width. Combinatorics, Probability & Computing 15(3): 397-409 (2006)
26		Luis A. Goddyn, Petr Hlinený, Winfried Hochstättler: Balanced Signings and the Chromatic Number of Oriented Matroids. Combinatorics, Probability & Computing 15(4): 523-539 (2006)
25		Petr Hlinený: Equivalence-free exhaustive generation of matroid representations. Discrete Applied Mathematics 154(8): 1210-1222 (2006)
24		Petr Hlinený, Geoff Whittle: Matroid tree-width. Eur. J. Comb. 27(7): 1117-1128 (2006)
23		Petr Hlinený: Branch-width, parse trees, and monadic second-order logic for matroids. J. Comb. Theory, Ser. B 96(3): 325-351 (2006)
22		Petr Hlinený: Crossing number is hard for cubic graphs. J. Comb. Theory, Ser. B 96(4): 455-471 (2006)
21		Omer Giménez, Petr Hlinený, Marc Noy: Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. SIAM J. Discrete Math. 20(4): 932-946 (2006)
20		Petr Hlinený, Detlef Seese: Trees, grids, and MSO decidability: From graphs to matroids. Theor. Comput. Sci. 351(3): 372-393 (2006)
	2005
19		Omer Giménez, Petr Hlinený, Marc Noy: Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. WG 2005: 59-68
18		Petr Hlinený: A Parametrized Algorithm for Matroid Branch-Width. SIAM J. Comput. 35(2): 259-277 (2005)
	2004
17		Petr Hlinený, Detlef Seese: On Decidability of MSO Theories of Representable Matroids. IWPEC 2004: 96-107
16		Petr Hlinený: Crossing Number Is Hard for Cubic Graphs. MFCS 2004: 772-782
15		Petr Hlinený, Robin Thomas: On possible counterexamples to Negami's planar cover conjecture. Journal of Graph Theory 46(3): 183-206 (2004)
14		James F. Geelen, Petr Hlinený, Geoffrey P. Whittle: Bridging Separations in Matroids. SIAM J. Discrete Math. 18(3): 638-646 (2004)
	2003
13		Petr Hlinený: On Matroid Properties Definable in the MSO Logic. MFCS 2003: 470-479
12		Petr Hlinený: Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids. STACS 2003: 319-330
11		Petr Hlinený: Crossing-number critical graphs have bounded path-width. J. Comb. Theory, Ser. B 88(2): 347-367 (2003)
	2002
10		Petr Hlinený: On the Excluded Minors for Matroids of Branch-Width Three. Electr. J. Comb. 9(1): (2002)
	2001
9		Petr Hlinený: Crossing-Critical Graphs and Path-Width. Graph Drawing 2001: 102-114
8		Petr Hlinený: An Addition to Art Galleries with Interior Walls. Discrete & Computational Geometry 25(2): 311-334 (2001)
7		Petr Hlinený, Jan Kratochvíl: Representing graphs by disks and balls (a survey of recognition-complexity results). Discrete Mathematics 229(1-3): 101-124 (2001)
6		Petr Hlinený: Contact graphs of line segments are NP-complete. Discrete Mathematics 235(1-3): 95-106 (2001)
	1998
5		Petr Hlinený: The Maximal Clique and Colourability of Curve Contact Graphs. Discrete Applied Mathematics 81(1-3): 59-68 (1998)
4		Petr Hlinený: Classes and Recognition of Curve Contact Graphs, . J. Comb. Theory, Ser. B 74(1): 87-103 (1998)
	1997
3		Petr Hlinený: Touching Graphs of Unit Balls. Graph Drawing 1997: 350-358
2		Petr Hlinený, Jan Kratochvíl: Computational Complexity of the Krausz Dimension of Graphs. WG 1997: 214-228
	1995
1		Petr Hlinený: Contact Graphs of Curves. Graph Drawing 1995: 312-323

Coauthor Index

1	Markus Chimani	[41] [53] [60] [61] [65] [66] [69]
2	Martin Derka	[60] [65]
3	Jakub Gajarský	[71]
4	Robert Ganian	[40] [44] [45] [49] [50] [51] [52] [54] [55] [58] [63] [73]
5	James F. Geelen (Jim Geelen)	[14]
6	Omer Giménez	[19] [21]
7	Isidoro Gitler	[31] [37]
8	Luis A. Goddyn	[26]
9	Georg Gottlob	[39]
10	Winfried Hochstättler	[26]
11	Eva Jelínková	[57]
12	Matej Klusácek	[60] [65]
13	Joachim Kneis	[44] [51] [54]
14	Jan Kratochvíl	[2] [7] [32] [57]
15	Antonín Kucera	[56] [68]
16	Alexander Langer	[44] [58] [73]
17	Jesús Leaños	[31] [37]
18	Václav Matyás	[43] [46]
19	Daniel Meister	[51] [54]
20	Ondrej Moris	[59] [62] [64] [67] [70] [72]
21	Petra Mutzel	[41] [69]
22	Roman Nedela	[32]
23	Marc Noy	[19] [21]
24	Jan Obdrzálek	[44] [50] [51] [54] [55] [58] [63] [73]
25	Sang-il Oum	[34] [35] [39]
26	Peter Rossmanith	[44] [51] [54] [58] [73]
27	Gelasio Salazar	[29] [31] [33] [36] [37] [47]
28	Detlef Seese	[17] [20] [39]
29	Somnath Sikdar	[51] [54] [58] [73]
30	Martin Skoviera	[32]
31	Ondrej Suchý	[57]
32	Robin Thomas	[15]
33	Tomás Vojnar	[43] [46]
34	Geoff Whittle (Geoffrey P. Whittle)	[14] [24] [42]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page