Petr Hlineny

Cited by

	All	Since 2016
Citations	2261	849
h-index	25	16
i10-index	60	27

220

110

165

20002001200220032004200520062007200820092010201120122013201420152016201720182019202020219 20 12 19 27 40 74 71 106 123 124 141 141 195 111 132 135 142 170 154 214 29

Co-authors

Jan ObdržálekMasaryk University, BrnoVerified email at fi.muni.cz
Robert GanianTU WienVerified email at ac.tuwien.ac.at
Jakub GajarskyPostdoc, 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
Sebastian OrdyniakUniversity of SheffieldVerified email at sheffield.ac.uk
Sang-il OumCI, Discrete Mathematics Group, Institute for Basic Science and Professor, KAISTVerified email at ibs.re.kr
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaVerified email at kam.mff.cuni.cz
Alexander LangerRWTH Aachen UniversityVerified email at cs.rwth-aachen.de
Ramanujan M. S.University of Warwick, UKVerified email at warwick.ac.uk
Jaroslav NešetřilCharles UniversityVerified email at kam.mff.cuni.cz
Daniel LokshtanovAssociate Professor in 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
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
Bodhayan RoyIndian Institute of Technology KharagpurVerified email at maths.iitkgp.ac.in
Antonin KuceraMasaryk UniversityVerified email at fi.muni.cz
Bojan MoharSimon Fraser University and IMFMVerified email at sfu.ca

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	173	2008
Finding branch-decompositions and rank-decompositions P Hliněný, S Oum Algorithms–ESA 2007, 163-174, 2007	168	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	93	2001
Crossing number is hard for cubic graphs P Hliněný Journal of Combinatorial Theory, Series B 96 (4), 455-471, 2006	82	2006
Branch-width, parse trees, and monadic second-order logic for matroids P Hliněný STACS 2003, 319-330, 2003	79	2003
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	62	2010
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	60	2017
When Trees Grow Low: Shrubs and Fast MSO₁ R Ganian, P Hliněný, J Nešetřil, J Obdržálek, PO de Mendez, ... International Symposium on Mathematical Foundations of Computer Science, 419-430, 2012	59	2012
Matroid tree-width P Hlinenı, G Whittle European Journal of Combinatorics 27 (7), 1117-1128, 2006	56*	2006
Are there any good digraph width measures? R Ganian, P Hliněný, J Kneis, D Meister, J Obdržálek, P Rossmanith, ... International Symposium on Parameterized and Exact Computation, 135-146, 2010	54	2010
A parametrized algorithm for matroid branch-width P Hlinený SIAM Journal on Computing 35 (2), 259-277, 2005	52	2005
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	45	2009
On the crossing number of almost planar graphs P Hliněný, G Salazar Graph Drawing, 162-173, 2007	43	2007
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	40	2006
Crossing-number critical graphs have bounded path-width P Hliněny Journal of Combinatorial Theory, Series B 88 (2), 347-367, 2003	37	2003
A new perspective on FO model checking of dense graph classes J Gajarský, P Hliněný, J Obdržálek, D Lokshtanov, MS Ramanujan 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-9, 2016	35	2016
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	35	2014
Classes and recognition of curve contact graphs P Hliněný Journal of Combinatorial Theory, Series B 74 (1), 87-103, 1998	34	1998
Better algorithms for satisfiability problems for formulas of bounded rank-width R Ganian, P Hliněný, J Obdržálek Fundamenta Informaticae 123 (1), 59-76, 2013	32	2013
On matroid properties definable in the MSO logic P Hliněný Mathematical Foundations of Computer Science 2003, 470-479, 2003	32	2003

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

Upload PDF

Follow this author

Cited by

Co-authors