Scholar

Petr Hlineny

Google Scholar ID: 6gR2tBkAAAAJ

Masaryk University, Brno, CZ

discrete mathematicstheoretical computer science

Citations & Impact

All-time

Citations

1,318

H-index

i10-index

Publications

Co-authors

list available

Contact

Publications

1 items

International Symposium on Computational Geometry · 2018

Cited

Resume (English only)

Academic Achievements

2025: 'Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges', Journal of Computer and System Sciences (to appear)
2025: 'Twin-width of Planar Graphs is at most 8, and some Related Bounds', SIAM Journal on Discrete Mathematics (to appear)
2025: 'A Unified FPT Framework for Crossing Number Problems', ESA (to appear)
2025: 'Transductions of Graph Classes Admitting Product Structure', LICS (to appear)
2025: 'On 13-Crossing-Critical Graphs with Arbitrarily Large Degrees', Discrete Mathematics 348, 114347
2025: 'Stack and Queue Numbers of Graphs Revisited' and 'Twin-width of Planar Graphs; a Short Proof', European Journal of Combinatorics 129
2024: 'Graph Product Structure for h-Framed Graphs', Electronic Journal of Combinatorics 31, #P4.56

Co-authors

26 total