Petr Hlineny

Navedeno

	Vse	Od leta 2018
Navedbe	2639	996
indeks h	28	16
indeks i10	65	31

260

130

195

2000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220237 19 14 18 27 41 70 70 101 116 105 136 134 201 113 129 134 127 165 137 173 206 260 51

Javni dostop

Prikaži vse

16 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Jan ObdržálekMasaryk University, BrnoPreverjeni e-poštni naslov na fi.muni.cz
Robert GanianTU WienPreverjeni e-poštni naslov na ac.tuwien.ac.at
Jakub GajarskyAssistant professor, University of WarsawPreverjeni e-poštni naslov na mimuw.edu.pl
Markus ChimaniProfessor for Theoretical Computer Science, Uni Osnabrück, GermanyPreverjeni e-poštni naslov na uni-osnabrueck.de
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaPreverjeni e-poštni naslov na kam.mff.cuni.cz
Gelasio SalazarInstituto de Fisica. Universidad Autonoma de San Luis PotosiPreverjeni e-poštni naslov na ifisica.uaslp.mx
Sebastian OrdyniakUniversity of LeedsPreverjeni e-poštni naslov na sheffield.ac.uk
Sang-il OumCI, Discrete Mathematics Group, Institute for Basic Science and Professor, KAISTPreverjeni e-poštni naslov na ibs.re.kr
Alexander LangerRWTH Aachen UniversityPreverjeni e-poštni naslov na cs.rwth-aachen.de
Jaroslav NešetřilCharles UniversityPreverjeni e-poštni naslov na kam.mff.cuni.cz
Ramanujan M. S.University of Warwick, UKPreverjeni e-poštni naslov na warwick.ac.uk
Daniel LokshtanovProfessor of Computer Science, UCSBPreverjeni e-poštni naslov na ucsb.edu
Petra MutzelProfessorin für Informatik, Universität BonnPreverjeni e-poštni naslov na cs.uni-bonn.de
Georg GottlobProfessor of Informatics, University of OxfordPreverjeni e-poštni naslov na cs.ox.ac.uk
Bodhayan RoyIndian Institute of Technology KharagpurPreverjeni e-poštni naslov na maths.iitkgp.ac.in
Daniel KralMasaryk UniversityPreverjeni e-poštni naslov na fi.muni.cz
Antonin KuceraMasaryk UniversityPreverjeni e-poštni naslov na fi.muni.cz
Zdenek DvorakComputer Science Institute, Charles University, PraguePreverjeni e-poštni naslov na ucw.cz
Felix ReidlLecturer, Birkbeck UniversityPreverjeni e-poštni naslov na dcs.bbk.ac.uk
Isidoro GitlerProfessor of Mathematics, Mathematics Department CINVESTAVPreverjeni e-poštni naslov na math.cinvestav.edu.mx

Spremljaj

Petr Hlineny

Masaryk University, Brno, CZ

Preverjeni e-poštni naslov na fi.muni.cz - Domača stran

discrete mathematics theoretical computer science


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
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	192	2008
Finding branch-decompositions and rank-decompositions P Hliněný, S Oum Algorithms–ESA 2007, 163-174, 2007	177	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	106	2001
Crossing number is hard for cubic graphs P Hliněný Journal of Combinatorial Theory, Series B 96 (4), 455-471, 2006	97	2006
Branch-width, parse trees, and monadic second-order logic for matroids P Hliněný STACS 2003, 319-330, 2003	81	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	70	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	68	2010
Are there any good digraph width measures? R Ganian, P Hlinený, J Kneis, D Meister, J Obdrzálek, P Rossmanith, ... IPEC 10, 135-146, 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	53	2020
A parametrized algorithm for matroid branch-width P Hlinený SIAM Journal on Computing 35 (2), 259-277, 2005	53	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	50	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	47	2007
Shrub-depth: Capturing height of dense graphs PO de Mendez, J Obdržálek, J Nešetřil, P Hliněný, R Ganian 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
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
Lower bounds on the complexity of MSO1 model-checking R Ganian, P Hliněný, A Langer, J Obdržálek, P Rossmanith, S Sikdar Journal of Computer and System Sciences 80 (1), 180-194, 2014	39	2014

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji