Petr Hlineny

Cited by

	All	Since 2018
Citations	2668	1025
h-index	29	17
i10-index	66	31

280

140

210

2000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220237 19 14 18 27 41 70 70 101 115 106 134 136 201 113 128 136 127 164 136 172 203 267 79

Public access

View all

17 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Jan ObdržálekMasaryk University, BrnoVerified email at fi.muni.cz
Robert GanianTU WienVerified email at ac.tuwien.ac.at
Jakub GajarskyAssistant professor, University of WarsawVerified email at mimuw.edu.pl
Markus ChimaniProfessor for Theoretical Computer Science, Uni Osnabrück, GermanyVerified email at uni-osnabrueck.de
Gelasio SalazarInstituto de Fisica. Universidad Autonoma de San Luis PotosiVerified email at ifisica.uaslp.mx
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaVerified email at kam.mff.cuni.cz
Sebastian OrdyniakUniversity of LeedsVerified email at sheffield.ac.uk
Sang-il OumCI, Discrete Mathematics Group, Institute for Basic Science and Professor, KAISTVerified email at ibs.re.kr
Alexander LangerRWTH Aachen UniversityVerified email at cs.rwth-aachen.de
Jaroslav NešetřilCharles UniversityVerified email at kam.mff.cuni.cz
Ramanujan M. S.University of Warwick, UKVerified email at warwick.ac.uk
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu
Petra MutzelProfessorin für Informatik, Universität BonnVerified email at cs.uni-bonn.de
Georg GottlobProfessor of Informatics, University of OxfordVerified email at cs.ox.ac.uk
Bodhayan RoyIndian Institute of Technology KharagpurVerified email at maths.iitkgp.ac.in
Daniel KralMasaryk UniversityVerified email at fi.muni.cz
Antonin KuceraMasaryk UniversityVerified email at fi.muni.cz
Zdenek DvorakComputer Science Institute, Charles University, PragueVerified email at ucw.cz
Felix ReidlLecturer, Birkbeck UniversityVerified email at dcs.bbk.ac.uk
Isidoro GitlerProfessor of Mathematics, Mathematics Department CINVESTAVVerified email at math.cinvestav.edu.mx

Petr Hlineny

Masaryk University, Brno, CZ

Verified email at fi.muni.cz - Homepage

discrete mathematics theoretical computer science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Width parameters beyond tree-width and their applications P Hliněný, S Oum, D Seese, G Gottlob The Computer Journal 51 (3), 326-362, 2008	196	2008
Finding branch-decompositions and rank-decompositions P Hliněný, S Oum Algorithms–ESA 2007, 163-174, 2007	181	2007
Representing graphs by disks and balls (a survey of recognition-complexity results) P Hlinny, J Kratochvíl Discrete Mathematics 229 (1-3), 101-124, 2001	108	2001
Crossing number is hard for cubic graphs P Hliněný Journal of Combinatorial Theory, Series B 96 (4), 455-471, 2006	98	2006
Branch-width, parse trees, and monadic second-order logic for matroids P Hliněný STACS 2003, 319-330, 2003	84	2003
When Trees Grow Low: Shrubs and Fast MSO₁ R Ganian, P Hliněný, J Nešetřil, J Obdržálek, P Ossona de Mendez, ... Mathematical Foundations of Computer Science 2012: 37th International …, 2012	73	2012
Kernelization using structural parameters on sparse graph classes J Gajarský, P Hliněný, J Obdržálek, S Ordyniak, F Reidl, P Rossmanith, ... Journal of Computer and System Sciences 84, 219-242, 2017	71	2017
On parse trees and Myhill–Nerode-type tools for handling graphs of bounded rank-width R Ganian, P Hliněný Discrete Applied Mathematics 158 (7), 851-867, 2010	69	2010
Are there any good digraph width measures? R Ganian, P Hliněný, J Kneis, D Meister, J Obdržálek, P Rossmanith, ... Parameterized and Exact Computation: 5th International Symposium, IPEC 2010 …, 2010	60	2010
Matroid tree-width P Hlinenı, G Whittle European Journal of Combinatorics 27 (7), 1117-1128, 2006	58*	2006
A new perspective on FO model checking of dense graph classes J Gajarský, P Hliněný, J Obdržálek, D Lokshtanov, MS Ramanujan ACM Transactions on Computational Logic (TOCL) 21 (4), 1-23, 2020	54	2020
A parametrized algorithm for matroid branch-width P Hlinený SIAM Journal on Computing 35 (2), 259-277, 2005	54	2005
Digraph width measures in parameterized algorithmics R Ganian, P Hliněný, J Kneis, A Langer, J Obdržálek, P Rossmanith Discrete applied mathematics 168, 88-107, 2014	51	2014
On digraph width measures in parameterized algorithmics R Ganian, P Hliněný, J Kneis, A Langer, J Obdržálek, P Rossmanith Parameterized and Exact Computation, 185-197, 2009	48	2009
On the crossing number of almost planar graphs P Hliněný, G Salazar Graph Drawing, 162-173, 2007	48	2007
Shrub-depth: Capturing height of dense graphs R Ganian, P Hliněný, J Nešetřil, J Obdržálek, PO De Mendez Logical Methods in Computer Science 15, 2019	45	2019
FO model checking on posets of bounded width J Gajarský, P Hlinený, D Lokshtanov, J Obdralek, S Ordyniak, ... 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 963-974, 2015	45	2015
Crossing-number critical graphs have bounded path-width P Hliněny Journal of Combinatorial Theory, Series B 88 (2), 347-367, 2003	44	2003
Kernelizing MSO properties of trees of fixed height, and some consequences J Gajarsky, P Hlineny arXiv preprint arXiv:1204.5194, 2012	42	2012
Computing the Tutte polynomial on graphs of bounded clique-width O Giménez, P Hliněný, M Noy SIAM Journal on Discrete Mathematics 20 (4), 932-946, 2006	41	2006

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors