Petr Hliněný

From MaRDI portal
Person:175586

Available identifiers

zbMath Open hlineny.petrWikidataQ62056479 ScholiaQ62056479MaRDI QIDQ175586

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61924742024-02-12Paper
On colourability of polygon visibility graphs2024-01-23Paper
Inserting Multiple Edges into a Planar Graph2023-09-20Paper
https://portal.mardi4nfdi.de/entity/Q61684342023-08-08Paper
Twin-width and transductions of proper \(k\)-mixed-thin graphs2023-05-05Paper
Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs2023-02-16Paper
Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\)2023-01-23Paper
Clique-width of point configurations2022-12-21Paper
Clique-width of point configurations2022-11-23Paper
https://portal.mardi4nfdi.de/entity/Q50889412022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50891622022-07-18Paper
Isomorphism testing for \(T\)-graphs in FPT2022-07-13Paper
On Colourability of Polygon Visibility Graphs2020-11-25Paper
Exact crossing number parameterized by vertex cover2020-10-26Paper
A New Perspective on FO Model Checking of Dense Graph Classes2020-09-11Paper
Structure and generation of crossing-critical graphs2020-08-18Paper
https://portal.mardi4nfdi.de/entity/Q51118782020-05-27Paper
On conflict-free chromatic guarding of simple polygons2020-05-13Paper
Toroidal grid minors and stretch in embedded graphs2020-01-15Paper
Exact Crossing Number Parameterized by Vertex Cover2019-06-14Paper
On degree properties of crossing-critical families of graphs2019-03-22Paper
https://portal.mardi4nfdi.de/entity/Q46256952019-02-25Paper
Parameterized shifted combinatorial optimization2018-12-10Paper
FO model checking on geometric graphs2018-12-07Paper
Parameterized extension complexity of independent set and related problems2018-09-17Paper
Deciding Parity of Graph Crossing Number2018-08-07Paper
A Simpler Self-reduction Algorithm for Matroid Path-Width2018-06-25Paper
A New Perspective on FO Model Checking of Dense Graph Classes2018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q46100402018-04-05Paper
https://portal.mardi4nfdi.de/entity/Q31328642018-01-30Paper
Crossing Number is Hard for Kernelization2018-01-30Paper
Parameterized shifted combinatorial optimization2017-10-23Paper
First order limits of sparse graphs: Plane trees and path-width2017-08-10Paper
A tighter insertion-based approximation of the crossing number2017-08-03Paper
Shrub-depth: Capturing Height of Dense Graphs2017-07-02Paper
On Degree Properties of Crossing-Critical Families of Graphs2017-02-10Paper
https://portal.mardi4nfdi.de/entity/Q29574852017-01-26Paper
A Short Proof of Euler--Poincar\'e Formula2016-12-05Paper
Kernelization using structural parameters on sparse graph classes2016-11-14Paper
Tree-depth and vertex-minors2016-05-11Paper
On Hardness of the Joint Crossing Number2016-01-11Paper
Faster Existential FO Model Checking on Posets2016-01-07Paper
FO Model Checking of Interval Graphs2016-01-07Paper
Are there any good digraph width measures?2015-12-11Paper
Faster Existential FO Model Checking on Posets2015-09-11Paper
Planar emulators conjecture is nearly true for cubic graphs2015-06-02Paper
Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences2015-04-22Paper
Computing the Stretch of an Embedded Graph2014-12-22Paper
https://portal.mardi4nfdi.de/entity/Q54199732014-06-11Paper
https://portal.mardi4nfdi.de/entity/Q54176772014-05-22Paper
Digraph width measures in parameterized algorithmics2014-04-02Paper
https://portal.mardi4nfdi.de/entity/Q54030592014-03-25Paper
Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking2014-01-28Paper
Kernelization Using Structural Parameters on Sparse Graph Classes2013-09-17Paper
FO Model Checking of Interval Graphs2013-08-07Paper
Stars and Bonds in Crossing-Critical Graphs2013-06-28Paper
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width2013-04-18Paper
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width2013-01-24Paper
How not to characterize planar-emulable graphs2013-01-14Paper
When Trees Grow Low: Shrubs and Fast MSO12012-09-25Paper
https://portal.mardi4nfdi.de/entity/Q29088382012-08-29Paper
https://portal.mardi4nfdi.de/entity/Q29047732012-08-23Paper
Vertex insertion approximates the crossing number of apex graphs2012-02-11Paper
https://portal.mardi4nfdi.de/entity/Q31137052012-01-23Paper
How Not to Characterize Planar-Emulable Graphs2012-01-13Paper
https://portal.mardi4nfdi.de/entity/Q31042532011-12-19Paper
Scope-Based Route Planning2011-09-16Paper
A tighter insertion-based approximation of the crossing number2011-07-06Paper
Stars and bonds in crossing-critical graphs2011-01-19Paper
Are There Any Good Digraph Width Measures?2010-12-07Paper
20 years of Negami's planar cover conjecture2010-11-12Paper
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width2010-05-25Paper
New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes2010-01-28Paper
On Digraph Width Measures in Parameterized Algorithmics2010-01-14Paper
Better Polynomial Algorithms on Graphs of Bounded Rank-Width2009-12-11Paper
Finding Branch-Decompositions and Rank-Decompositions2009-06-22Paper
Addendum to matroid tree-width2009-06-17Paper
The crossing number of a projective graph is quadratic in the face-width2009-04-07Paper
New infinite families of almost-planar crossing-critical graphs2009-04-07Paper
Approximating the Crossing Number of Apex Graphs2009-03-03Paper
Finding Branch-Decompositions and Rank-Decompositions2008-09-25Paper
The crossing number of a projective graph is quadratic in the face–width2008-06-05Paper
Approximating the Crossing Number of Toroidal Graphs2008-05-27Paper
Some hard problems on matroid spikes2007-12-19Paper
Mathematical Foundations of Computer Science 20032007-12-07Paper
Computing the Tutte Polynomial on Graphs of Bounded Clique‐Width2007-11-16Paper
On Matroid Representability and Minor Problems2007-09-05Paper
On the Crossing Number of Almost Planar Graphs2007-08-28Paper
Balanced Signings and the Chromatic Number of Oriented Matroids2007-07-30Paper
https://portal.mardi4nfdi.de/entity/Q34101022006-11-21Paper
Matroid tree-width2006-11-15Paper
Graph-Theoretic Concepts in Computer Science2006-11-01Paper
Crossing number is hard for cubic graphs2006-07-12Paper
The Tutte Polynomial for Matroids of Bounded Branch-Width2006-07-06Paper
Equivalence-free exhaustive generation of matroid representations2006-06-30Paper
A Parametrized Algorithm for Matroid Branch-Width2006-06-01Paper
Branch-width, parse trees, and monadic second-order logic for matroids.2006-05-18Paper
Trees, grids, and MSO decidability: from graphs to matroids2006-04-06Paper
Bridging Separations in Matroids2005-09-16Paper
Parameterized and Exact Computation2005-08-23Paper
Mathematical Foundations of Computer Science 20042005-08-22Paper
https://portal.mardi4nfdi.de/entity/Q46699122005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q30437092004-08-06Paper
On possible counterexamples to Negami's planar cover conjecture2004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44505672004-02-15Paper
Crossing-number critical graphs have bounded path-width2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q44186602003-08-11Paper
On the excluded minors for matroids of branch-width three2002-09-22Paper
Another two graphs with no planar covers2002-09-11Paper
An addition to art galleries with interior walls2002-05-29Paper
Contact graphs of line segments are NP-complete2002-03-29Paper
Representing graphs by disks and balls (a survey of recognition-complexity results)2001-10-07Paper
Classes and recognition of curve contact graphs2000-09-05Paper
https://portal.mardi4nfdi.de/entity/Q47187332000-04-09Paper
https://portal.mardi4nfdi.de/entity/Q43736831998-06-11Paper
The maximal clique and colourability of curve contact graphs1998-03-25Paper
https://portal.mardi4nfdi.de/entity/Q43765051998-03-15Paper
https://portal.mardi4nfdi.de/entity/Q48525521996-05-30Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Petr Hliněný