ResearcherID Thomson Reuters  

Hliněný, Petr
Create a ResearcherID badge for this researcher View publications analytics for this researcher
Close
ResearcherID: F-1127-2011
URL: http://www.researcherid.com/rid/F-1127-2011
Subject: Computer Science; Mathematics
Keywords: parameterized algorithmics; structural graph theory; graph crossing numbers
ORCID: http://orcid.org/0000-0003-2125-1514
My Institutions (more details)
Primary Institution:
Sub-org/Dept: Faculty of Informatics
Role:
My URLs: http://www.fi.muni.cz/~hlineny
 
 

This list contains papers that I have authored.

publication(s)  
First Page Previous Page Page   of  9  Go Next Page Last Page
  Sort by:    Results per page: 
1.  Title: Width parameters beyond tree-width and their applications
 Author(s): Hlineny, P.; Oum, S. I.; Seese, D.; et al.
 Source: Computer Journal Volume: 51 Issue: 3 Pages: 326-362 Published: 2008
 Times Cited: 56
 DOI: 10.1093/comjnl/bxm052
added
08-Sep-11
2.  Title: Finding branch-decompositions and rank-decompositions
 Author(s): Hlineny, P.; Oum, S. I.
 Source: Siam Journal on Computing Volume: 38 Issue: 3 Pages: 1012-1032 Published: 2008
 Times Cited: 48
 DOI: 10.1137/070685920
added
08-Sep-11
3.  Title: Representing graphs by disks and balls (a survey of recognition-complexity results)
 Author(s): Hlineny, P.; Kratochvil, J.
 Source: Discrete Mathematics Volume: 229 Issue: 1-3 Pages: 101-124 Published: 2001
 Times Cited: 37
 DOI: 10.1016/s0012-365x(00)00204-1
added
08-Sep-11
4.  Title: Crossing number is hard for cubic graphs
 Author(s): Hlineny, P.
 Source: Journal of Combinatorial Theory Series B Volume: 96 Issue: 4 Pages: 455-471 Published: 2006
 Times Cited: 32
 DOI: 10.1016/j.jctb.2005.09.009
added
08-Sep-11
5.  Title: Branch-width, parse trees, and monadic second-order logic for matroids
 Author(s): Hlineny, P.
 Source: Journal of Combinatorial Theory Series B Volume: 96 Issue: 3 Pages: 325-351 Published: 2006
 Times Cited: 23
 DOI: 10.1016/j.jctb.2005.08.005
added
08-Sep-11
6.  Title: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
 Author(s): Ganian, R.; Hlineny, P.
 Source: Discrete Applied Mathematics Volume: 158 Issue: 7 Pages: 851-867 Published: 2010
 Times Cited: 22
 DOI: 10.1016/j.dam.2009.10.018
added
08-Sep-11
7.  Title: A parametrized algorithm for matroid branch-width
 Author(s): Hlineny, P.
 Source: Siam Journal on Computing Volume: 35 Issue: 2 Pages: 259-277 Published: 2005
 Times Cited: 22
 DOI: 10.1137/s0097539702418589
added
08-Sep-11
8.  Title: Crossing-number critical graphs have bounded path-width
 Author(s): Hlineny, P.
 Source: Journal of Combinatorial Theory Series B Volume: 88 Issue: 2 Pages: 347-367 Published: 2003
 Times Cited: 20
 DOI: 10.1016/s0095-8956(03)00037-6
added
08-Sep-11
9.  Title: Matroid tree-width
 Author(s): Hlineny, P.; Whittle, G.
 Source: European Journal of Combinatorics Volume: 27 Issue: 7 Pages: 1117-1128 Published: 2006
 Times Cited: 19
 DOI: 10.1016/j.ejc.2006.06.005
added
08-Sep-11
10.  Title: On the crossing number of almost planar graphs
 Author(s): Hlineny, P.; Salazar, G.
 Source: Graph Drawing Volume: 4372 Pages: 162-173 Published: 2007
 Times Cited: 16
added
08-Sep-11
publication(s)  
First Page Previous Page Page   of  9  Go Next Page Last Page
  Sort by:    Results per page: