The following pages link to Petr Hliněný (Q175586):
Displayed 50 items.
- Tree-depth and vertex-minors (Q281932) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- 20 years of Negami's planar cover conjecture (Q604985) (← links)
- Vertex insertion approximates the crossing number of apex graphs (Q661940) (← links)
- On the excluded minors for matroids of branch-width three (Q698604) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- Matroid tree-width (Q852702) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- (Q1010758) (redirect page) (← links)
- The crossing number of a projective graph is quadratic in the face-width (Q1010759) (← links)
- New infinite families of almost-planar crossing-critical graphs (Q1010829) (← links)
- Addendum to matroid tree-width (Q1024300) (← links)
- Classes and recognition of curve contact graphs (Q1272471) (← links)
- The maximal clique and colourability of curve contact graphs (Q1382253) (← links)
- Crossing-number critical graphs have bounded path-width (Q1400969) (← links)
- FO model checking on geometric graphs (Q1631773) (← links)
- On degree properties of crossing-critical families of graphs (Q1733938) (← links)
- How not to characterize planar-emulable graphs (Q1931406) (← links)
- A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width (Q1933649) (← links)
- A tighter insertion-based approximation of the crossing number (Q2012882) (← links)
- Isomorphism testing for \(T\)-graphs in FPT (Q2154101) (← links)
- On conflict-free chromatic guarding of simple polygons (Q2180187) (← links)
- Exact crossing number parameterized by vertex cover (Q2206863) (← links)
- Toroidal grid minors and stretch in embedded graphs (Q2284733) (← links)
- Planar emulators conjecture is nearly true for cubic graphs (Q2346578) (← links)
- Parameterized extension complexity of independent set and related problems (Q2413967) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Some hard problems on matroid spikes (Q2464317) (← links)
- Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835) (← links)
- Equivalence-free exhaustive generation of matroid representations (Q2495901) (← links)
- Crossing number is hard for cubic graphs (Q2496198) (← links)
- Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\) (Q2678451) (← links)
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs (Q2684481) (← links)
- Another two graphs with no planar covers (Q2746205) (← links)
- Kernelization Using Structural Parameters on Sparse Graph Classes (Q2849343) (← links)
- (Q2904773) (← links)
- (Q2908838) (← links)
- When Trees Grow Low: Shrubs and Fast MSO1 (Q2912741) (← links)
- Computing the Stretch of an Embedded Graph (Q2935274) (← links)
- (Q2957485) (← links)
- On Degree Properties of Crossing-Critical Families of Graphs (Q2959744) (← links)
- (Q3043709) (← links)
- Are There Any Good Digraph Width Measures? (Q3058698) (← links)
- Stars and bonds in crossing-critical graphs (Q3069675) (← links)
- Scope-Based Route Planning (Q3092251) (← links)
- (Q3104253) (← links)
- How Not to Characterize Planar-Emulable Graphs (Q3111644) (← links)
- (Q3113705) (← links)