| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Petr Hlinený, Antonín Kucera |
Preface.  |
Theor. Comput. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Chimani, Petr Hlinený, Petra Mutzel |
Vertex insertion approximates the crossing number of apex graphs. |
Eur. J. Comb. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený, Ondrej Moris |
Dynamic Scope-Based Dijkstra's Algorithm |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Jakub Gajarský, Petr Hlinený |
Deciding Graph MSO Properties: Has it all been told already? |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Eva Jelínková, Ondrej Suchý, Petr Hlinený, Jan Kratochvíl |
Parameterized Problems Related to Seidel's Switching. |
Discrete Mathematics & Theoretical Computer Science |
2011 |
DBLP BibTeX RDF |
|
| 1 | Markus Chimani, Petr Hlinený |
A Tighter Insertion-based Approximation of the Crossing Number |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Lower Bounds on the Complexity of MSO1 Model-Checking |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Petr Hlinený, Ondrej Moris |
Multi-Stage Improved Route Planning Approach: theoretical foundations |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek |
How Not to Characterize Planar-emulable Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Petr Hlinený, Ondrej Moris |
Generalized Maneuvers in Route Planning |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Petr Hlinený, Ondrej Moris |
Scope-Based Route Planning. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Chimani, Petr Hlinený |
A Tighter Insertion-Based Approximation of the Crossing Number. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Jan Obdrzálek |
Clique-width: When Hard Does Not Mean Impossible. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený, Ondrej Moris |
Generalized Maneuvers in Route Planning. |
MEMICS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek |
How Not to Characterize Planar-Emulable Graphs. |
IWOCA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený |
20 Years of Negami's Planar Cover Conjecture. |
Graphs and Combinatorics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Jan Obdrzálek |
Better algorithms for satisfiability problems for formulas of bounded rank-width |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Are there any good digraph width measures? |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Petr Hlinený, Gelasio Salazar |
Stars and bonds in crossing-critical graphs. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený |
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený, Markus Chimani |
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Petr Hlinený, Antonín Kucera (eds.) |
Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Are There Any Good Digraph Width Measures? |
IPEC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený |
New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes. |
SOFSEM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Jan Obdrzálek |
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený, Geoff Whittle |
Addendum to matroid tree-width. |
Eur. J. Comb. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith |
On Digraph Width Measures in Parameterized Algorithmics. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Petr Hlinený, Václav Matyás, Tomás Vojnar (eds.) |
Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2009, November 13-15, 2009, Prestige Hotel, Znojmo, Czech Republic |
MEMICS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený |
Better Polynomial Algorithms on Graphs of Bounded Rank-Width. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
Rank-width, rank-decomposition, chromatic polynomial, Hamiltonian path, chromatic number |
| 1 | Petr Hlinený, Gelasio Salazar |
Stars and Bonds in Crossing-Critical Graphs. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený |
New Infinite Families of Almost-Planar Crossing-Critical Graphs. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Petr Hlinený, Sang-il Oum, Detlef Seese, Georg Gottlob |
Width Parameters Beyond Tree-width and their Applications. |
Comput. J. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený, Sang-il Oum |
Finding Branch-Decompositions and Rank-Decompositions. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Chimani, Petr Hlinený, Petra Mutzel |
Approximating the Crossing Number of Apex Graphs. |
Graph Drawing |
2008 |
DBLP DOI BibTeX RDF |
apex graph, vertex insertion, Crossing number |
| 1 | Petr Hlinený, Robert Ganian |
Automata approach to graphs of bounded rank-width. |
IWOCA |
2008 |
DBLP BibTeX RDF |
|
| 1 | Petr Hlinený, Jan Kratochvíl, Roman Nedela, Martin Skoviera |
Preface. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený |
Some Hard Problems on Matroid Spikes. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený, Sang-il Oum |
Finding Branch-Decompositions and Rank-Decompositions. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
Rank-width, fixed parameter tractable algorithm, graph, matroid, clique-width, branch-width |
| 1 | Petr Hlinený, Gelasio Salazar |
Approximating the Crossing Number of Toroidal Graphs. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
2000 Math Subject Classification 05C10, 05C62, 68R10 |
| 1 | Petr Hlinený |
Crossing number is hard for cubic graphs. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený |
Branch-width, parse trees, and monadic second-order logic for matroids. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený, Detlef Seese |
Trees, grids, and MSO decidability: From graphs to matroids. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený, Geoff Whittle |
Matroid tree-width. |
Eur. J. Comb. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený |
The Tutte Polynomial for Matroids of Bounded Branch-Width. |
Combinatorics, Probability & Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis A. Goddyn, Petr Hlinený, Winfried Hochstättler |
Balanced Signings and the Chromatic Number of Oriented Matroids. |
Combinatorics, Probability & Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Giménez, Petr Hlinený, Marc Noy |
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. |
SIAM J. Discrete Math. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený |
Equivalence-free exhaustive generation of matroid representations. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený |
On Matroid Representability and Minor Problems. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
Matroid representability, spike, swirl. 2000 Math subject classification: 05B35, finite field, 68Q17, 68R05, minor |
| 1 | Petr Hlinený, Gelasio Salazar |
On the Crossing Number of Almost Planar Graphs. |
Graph Drawing |
2006 |
DBLP DOI BibTeX RDF |
crossing-critical graphs, planarization, crossing number, crossing minimization |
| 1 | Petr Hlinený |
A Parametrized Algorithm for Matroid Branch-Width. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Giménez, Petr Hlinený, Marc Noy |
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. |
WG |
2005 |
DBLP DOI BibTeX RDF |
subexponential algorithm, U polynomial, cographs, clique-width, Tutte polynomial |
| 1 | James F. Geelen, Petr Hlinený, Geoffrey P. Whittle |
Bridging Separations in Matroids. |
SIAM J. Discrete Math. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený, Robin Thomas |
On possible counterexamples to Negami's planar cover conjecture. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený |
Crossing Number Is Hard for Cubic Graphs. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
NP-completeness, Crossing number, cubic graph |
| 1 | Petr Hlinený, Detlef Seese |
On Decidability of MSO Theories of Representable Matroids. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
MSO theory, decidability, matroid, branch-width |
| 1 | Petr Hlinený |
Crossing-number critical graphs have bounded path-width. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený |
On Matroid Properties Definable in the MSO Logic. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
MSO logic, parametrized complexity, matroid, branch-width |
| 1 | Petr Hlinený |
Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
representable matroid, fixed-parameter complexity, Classification: parametrized complexity and logic in computer science. (Math subjects 05B35, 68R05, 03D05.), monadic second-order logic, branch-width |
| 1 | Petr Hlinený |
On the Excluded Minors for Matroids of Branch-Width Three. |
Electr. J. Comb. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Petr Hlinený, Jan Kratochvíl |
Representing graphs by disks and balls (a survey of recognition-complexity results). |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený |
Contact graphs of line segments are NP-complete. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený |
An Addition to Art Galleries with Interior Walls. |
Discrete & Computational Geometry |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený |
Crossing-Critical Graphs and Path-Width. |
Graph Drawing |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený |
Classes and Recognition of Curve Contact Graphs, . |
J. Comb. Theory, Ser. B |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený |
The Maximal Clique and Colourability of Curve Contact Graphs. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený, Jan Kratochvíl |
Computational Complexity of the Krausz Dimension of Graphs. |
WG |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený |
Touching Graphs of Unit Balls. |
Graph Drawing |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený |
Contact Graphs of Curves. |
Graph Drawing |
1995 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")