×

zbMATH — the first resource for mathematics

Hliněný, Petr

Compute Distance To:
Author ID: hlineny.petr Recent zbMATH articles by "Hliněný, Petr"
Published as: Hlineny, P.; Hlineny, Petr; Hlinený, Petr; Hliněny, Petr; Hliněný, P.; Hliněný, Petr; Hliněnýi, Petr
External Links: MGP · ORCID
Documents Indexed: 108 Publications since 1995, including 5 Books

Publications by Year

Citations contained in zbMATH

75 Publications have been cited 412 times in 262 Documents Cited by Year
Finding branch-decompositions and rank-decompositions. Zbl 1163.05331
Hliněný, Petr; Oum, Sang-Il
42
2008
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Zbl 1231.05096
Ganian, Robert; Hliněný, Petr
25
2010
Are there any good digraph width measures? Zbl 1309.68150
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Meister, Daniel; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
15
2010
On digraph width measures in parameterized algorithmics. Zbl 1273.68276
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter
15
2009
Kernelization using structural parameters on sparse graph classes. Zbl 1353.68127
Gajarský, Jakub; Hliněný, Petr; Obdržálek, Jan; Ordyniak, Sebastian; Reidl, Felix; Rossmanith, Peter; Sánchez Villaamil, Fernando; Sikdar, Somnath
14
2017
Representing graphs by disks and balls (a survey of recognition-complexity results). Zbl 0969.68118
Hliněný, Petr; Kratochvíl, Jan
14
2001
When trees grow low: shrubs and fast \(\mathrm{MSO}_{1}\). Zbl 1365.68323
Ganian, Robert; Hliněný, Petr; Nešetřil, Jaroslav; Obdržálek, Jan; Ossona de Mendez, Patrice; Ramadurai, Reshma
13
2012
Crossing number is hard for cubic graphs. Zbl 1092.05016
Hliněný, Petr
13
2006
Digraph width measures in parameterized algorithmics. Zbl 1285.05077
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter
12
2014
Branch-width, parse trees, and monadic second-order logic for matroids. Zbl 1088.05022
Hliněný, Petr
12
2006
Matroid tree-width. Zbl 1103.05019
Hliněný, Petr; Whittle, Geoff
10
2006
Crossing-number critical graphs have bounded path-width. Zbl 1021.05028
Hliněny, Petr
10
2003
Kernelization using structural parameters on sparse graph classes. Zbl 1353.68126
Gajarský, Jakub; Hliněný, Petr; Obdržálek, Jan; Ordyniak, Sebastian; Reidl, Felix; Rossmanith, Peter; Sánchez Villaamil, Fernando; Sikdar, Somnath
8
2013
Vertex insertion approximates the crossing number of apex graphs. Zbl 1230.05267
Chimani, Markus; Hliněný, Petr; Mutzel, Petra
7
2012
Clique-width: when hard does not mean impossible. Zbl 1230.68109
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan
7
2011
Approximating the crossing number of toroidal graphs. Zbl 1193.05116
Hliněný, Petr; Salazar, Gelasio
7
2007
On the crossing number of almost planar graphs. Zbl 1185.68485
Hliněný, Petr; Salazar, Gelasio
7
2007
A parametrized algorithm for matroid branch-width. Zbl 1088.05023
Hliněný, Petr
7
2005
On possible counterexamples to Negami’s planar cover conjecture. Zbl 1049.05028
Hliněný, Petr; Thomas, Robin
7
2004
On matroid properties definable in the MSO logic. Zbl 1124.68373
Hliněný, Petr
7
2003
Shrub-depth: capturing height of dense graphs. Zbl 07029306
Ganian, Robert; Hliněný, Petr; Nešetřil, Jaroslav; Obdržálek, Jan; Ossona de Mendez, Patrice
6
2019
Better algorithms for satisfiability problems for formulas of bounded rank-width. Zbl 1280.68239
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan
6
2013
Approximating the crossing number of graphs embeddable in any orientable surface. Zbl 1288.68268
Hliněný, Petr; Chimani, Markus
6
2010
\(K_{4,4}-e\) has no finite planar cover. Zbl 0892.05039
Hliněný, Petr
6
1998
First order limits of sparse graphs: plane trees and path-width. Zbl 1368.05088
Gajarský, Jakub; Hliněný, Petr; Kaiser, Tomáš; Král’, Daniel; Kupec, Martin; Obdržálek, Jan; Ordyniak, Sebastian; Tůma, Vojtěch
5
2017
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width. Zbl 1257.05168
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan
5
2013
A tighter insertion-based approximation of the crossing number. Zbl 1332.68284
Chimani, Markus; Hliněný, Petr
5
2011
Computing the Tutte polynomial on graphs of bounded clique-width. Zbl 1126.05092
Giménez, Omer; Hliněný, Petr; Noy, Marc
5
2006
Classes and recognition of curve contact graphs. Zbl 0943.05069
Hliněný, Petr
5
1998
Inserting multiple edges into a planar graph. Zbl 1388.68216
Chimani, Markus; Hliněný, Petr
4
2016
Are there any good digraph width measures? Zbl 1327.05136
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Meister, Daniel; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
4
2016
Better algorithms for satisfiability problems for formulas of bounded rank-width. Zbl 1245.68108
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan
4
2010
20 years of Negami’s planar cover conjecture. Zbl 1218.05134
Hliněný, Petr
4
2010
The crossing number of a projective graph is quadratic in the face-width. Zbl 1159.05016
Gitler, I.; Hlineny, P.; Leaños, J.; Salazar, G.
4
2008
The Tutte polynomial for matroids of bounded branch-width. Zbl 1095.05009
Hliněný, Petr
4
2006
Bridging separations in matroids. Zbl 1069.05017
Geelen, Jim; Hliněný, Petr; Whittle, Geoff
4
2005
A new perspective on FO model checking of dense graph classes. Zbl 1401.68196
Gajarský, J.; Hliněný, P.; Obdržálek, J.; Lokshtanov, D.; Ramanujan, M. S.
3
2016
Tree-depth and vertex-minors. Zbl 1335.05168
Hliněný, Petr; Kwon, O-joung; Obdržálek, Jan; Ordyniak, Sebastian
3
2016
FO model checking of interval graphs. Zbl 1448.68299
Ganian, Robert; Hliněny, Petr; Král, Daniel; Obdržálek, Jan; Schwartz, Jarett; Teska, Jakub
3
2015
Faster existential FO model checking on posets. Zbl 1433.68216
Gajarský, Jakub; Hliněný, Petr; Obdržálek, Jan; Ordyniak, Sebastian
3
2014
Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking. Zbl 1311.68087
Ganian, Robert; Hliněný, Petr; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
3
2014
New results on the complexity of oriented colouring on restricted digraph classes. Zbl 1274.68138
Ganian, Robert; Hliněný, Petr
3
2010
Better polynomial algorithms on graphs of bounded rank-width. Zbl 1267.05258
Ganian, Robert; Hliněný, Petr
3
2009
Addendum to matroid tree-width. Zbl 1207.05029
Hliněný, Petr; Whittle, Geoff
3
2009
Finding branch-decompositions and rank-decompositions. Zbl 1151.05046
Hliněný, Petr; Oum, Sang-il
3
2007
Some hard problems on matroid spikes. Zbl 1126.05030
Hliněný, Petr
3
2007
Balanced signings and the chromatic number of oriented matroids. Zbl 1119.52016
Goddyn, Luis; Hliněný, Petr; Hochstättler, Winfried
3
2006
Trees, grids, and MSO decidability: from graphs to matroids. Zbl 1093.03006
Hliněný, Petr; Seese, Detlef
3
2006
Computing the Tutte polynomial on graphs of bounded clique-width. Zbl 1126.05302
Giménez, Omer; Hliněný, Petr; Noy, Marc
3
2005
On the excluded minors for matroids of branch-width three. Zbl 1003.05029
Hliněný, Petr
3
2002
Contact graphs of line segments are NP-complete. Zbl 0982.05083
Hliněný, Petr
3
2001
A note on possible extensions of Negami’s conjecture. Zbl 0934.05105
Hliněný, Petr
3
1999
The maximal clique and colourability of curve contact graphs. Zbl 0898.05025
Hliněný, Petr
3
1998
A tighter insertion-based approximation of the crossing number. Zbl 1369.05042
Chimani, Markus; Hliněný, Petr
2
2017
Kernelizing MSO properties of trees of fixed height, and some consequences. Zbl 1392.03022
Gajarský, Jakub; Hliněný, Petr
2
2015
How not to characterize planar-emulable graphs. Zbl 1256.05055
Chimani, Markus; Derka, Martin; Hliněný, Petr; Klusáček, Matěj
2
2013
Faster deciding MSO properties of trees of fixed height, and some consequences. Zbl 1354.68122
Gajarský, Jakub; Hliněný, Petr
2
2012
Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking. Zbl 1245.68107
Ganian, Robert; Hliněný, Petr; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
2
2012
Stars and bonds in crossing-critical graphs. Zbl 1221.05083
Hliněný, Petr; Salazar, Gelasio
2
2010
The crossing number of a projective graph is quadratic in the face-width. Zbl 1341.05040
Gitler, Isidoro; Hliněný, Petr; Leaños, Jesus; Salazar, Gelasio
2
2007
On matroid representability and minor problems. Zbl 1132.05310
Hliněný, Petr
2
2006
Using a computer in matroid theory research. Zbl 1063.05030
Hliněný, Petr
2
2004
Compuational complexity of the Krausz dimension of graphs. Zbl 0890.68094
Hliněnýi, Petr; Kratochvíl, Jan
2
1997
Crossing number is hard for kernelization. Zbl 1387.68181
Hliněný, Petr; Derňár, Marek
1
2016
Computing the stretch of an embedded graph. Zbl 1305.05050
Cabello, Sergio; Chimani, Markus; Hliněný, Petr
1
2014
Parameterized problems related to Seidel’s switching. Zbl 1283.68164
Jelinkova, Eva; Suchy, Ondrej; Hlineny, Petr; Kratochvil, Jan
1
2011
Approximating the crossing number of apex graphs. Zbl 1213.05050
Chimani, Markus; Hliněný, Petr; Mutzel, Petra
1
2009
Stars and bonds in crossing-critical graphs. Zbl 1267.05089
Hliněný, Petr; Salazar, Gelasio
1
2008
New infinite families of almost-planar crossing-critical graphs. Zbl 1165.05322
Hlineny, Petr
1
2008
On decidability of MSO theories of representable matroids. Zbl 1104.03007
Hliněný, Petr; Seese, Detlef
1
2004
Crossing number is hard for cubic graphs. Zbl 1097.68047
Hliněný, Petr
1
2004
Branch-width, parse trees, and monadic second-order logic for matroids. Zbl 1035.05029
Hliněný, Petr
1
2003
Crossing-critical graphs and path-width. Zbl 1054.68590
Hliněný, Petr
1
2002
Another two graphs with no planar covers. Zbl 0992.05035
Hliněný, Petr
1
2001
An addition to art galleries with interior walls. Zbl 0986.52005
Hliněný, P.
1
2001
Shrub-depth: capturing height of dense graphs. Zbl 07029306
Ganian, Robert; Hliněný, Petr; Nešetřil, Jaroslav; Obdržálek, Jan; Ossona de Mendez, Patrice
6
2019
Kernelization using structural parameters on sparse graph classes. Zbl 1353.68127
Gajarský, Jakub; Hliněný, Petr; Obdržálek, Jan; Ordyniak, Sebastian; Reidl, Felix; Rossmanith, Peter; Sánchez Villaamil, Fernando; Sikdar, Somnath
14
2017
First order limits of sparse graphs: plane trees and path-width. Zbl 1368.05088
Gajarský, Jakub; Hliněný, Petr; Kaiser, Tomáš; Král’, Daniel; Kupec, Martin; Obdržálek, Jan; Ordyniak, Sebastian; Tůma, Vojtěch
5
2017
A tighter insertion-based approximation of the crossing number. Zbl 1369.05042
Chimani, Markus; Hliněný, Petr
2
2017
Inserting multiple edges into a planar graph. Zbl 1388.68216
Chimani, Markus; Hliněný, Petr
4
2016
Are there any good digraph width measures? Zbl 1327.05136
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Meister, Daniel; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
4
2016
A new perspective on FO model checking of dense graph classes. Zbl 1401.68196
Gajarský, J.; Hliněný, P.; Obdržálek, J.; Lokshtanov, D.; Ramanujan, M. S.
3
2016
Tree-depth and vertex-minors. Zbl 1335.05168
Hliněný, Petr; Kwon, O-joung; Obdržálek, Jan; Ordyniak, Sebastian
3
2016
Crossing number is hard for kernelization. Zbl 1387.68181
Hliněný, Petr; Derňár, Marek
1
2016
FO model checking of interval graphs. Zbl 1448.68299
Ganian, Robert; Hliněny, Petr; Král, Daniel; Obdržálek, Jan; Schwartz, Jarett; Teska, Jakub
3
2015
Kernelizing MSO properties of trees of fixed height, and some consequences. Zbl 1392.03022
Gajarský, Jakub; Hliněný, Petr
2
2015
Digraph width measures in parameterized algorithmics. Zbl 1285.05077
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter
12
2014
Faster existential FO model checking on posets. Zbl 1433.68216
Gajarský, Jakub; Hliněný, Petr; Obdržálek, Jan; Ordyniak, Sebastian
3
2014
Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking. Zbl 1311.68087
Ganian, Robert; Hliněný, Petr; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
3
2014
Computing the stretch of an embedded graph. Zbl 1305.05050
Cabello, Sergio; Chimani, Markus; Hliněný, Petr
1
2014
Kernelization using structural parameters on sparse graph classes. Zbl 1353.68126
Gajarský, Jakub; Hliněný, Petr; Obdržálek, Jan; Ordyniak, Sebastian; Reidl, Felix; Rossmanith, Peter; Sánchez Villaamil, Fernando; Sikdar, Somnath
8
2013
Better algorithms for satisfiability problems for formulas of bounded rank-width. Zbl 1280.68239
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan
6
2013
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width. Zbl 1257.05168
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan
5
2013
How not to characterize planar-emulable graphs. Zbl 1256.05055
Chimani, Markus; Derka, Martin; Hliněný, Petr; Klusáček, Matěj
2
2013
When trees grow low: shrubs and fast \(\mathrm{MSO}_{1}\). Zbl 1365.68323
Ganian, Robert; Hliněný, Petr; Nešetřil, Jaroslav; Obdržálek, Jan; Ossona de Mendez, Patrice; Ramadurai, Reshma
13
2012
Vertex insertion approximates the crossing number of apex graphs. Zbl 1230.05267
Chimani, Markus; Hliněný, Petr; Mutzel, Petra
7
2012
Faster deciding MSO properties of trees of fixed height, and some consequences. Zbl 1354.68122
Gajarský, Jakub; Hliněný, Petr
2
2012
Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking. Zbl 1245.68107
Ganian, Robert; Hliněný, Petr; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
2
2012
Clique-width: when hard does not mean impossible. Zbl 1230.68109
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan
7
2011
A tighter insertion-based approximation of the crossing number. Zbl 1332.68284
Chimani, Markus; Hliněný, Petr
5
2011
Parameterized problems related to Seidel’s switching. Zbl 1283.68164
Jelinkova, Eva; Suchy, Ondrej; Hlineny, Petr; Kratochvil, Jan
1
2011
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Zbl 1231.05096
Ganian, Robert; Hliněný, Petr
25
2010
Are there any good digraph width measures? Zbl 1309.68150
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Meister, Daniel; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
15
2010
Approximating the crossing number of graphs embeddable in any orientable surface. Zbl 1288.68268
Hliněný, Petr; Chimani, Markus
6
2010
Better algorithms for satisfiability problems for formulas of bounded rank-width. Zbl 1245.68108
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan
4
2010
20 years of Negami’s planar cover conjecture. Zbl 1218.05134
Hliněný, Petr
4
2010
New results on the complexity of oriented colouring on restricted digraph classes. Zbl 1274.68138
Ganian, Robert; Hliněný, Petr
3
2010
Stars and bonds in crossing-critical graphs. Zbl 1221.05083
Hliněný, Petr; Salazar, Gelasio
2
2010
On digraph width measures in parameterized algorithmics. Zbl 1273.68276
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter
15
2009
Better polynomial algorithms on graphs of bounded rank-width. Zbl 1267.05258
Ganian, Robert; Hliněný, Petr
3
2009
Addendum to matroid tree-width. Zbl 1207.05029
Hliněný, Petr; Whittle, Geoff
3
2009
Approximating the crossing number of apex graphs. Zbl 1213.05050
Chimani, Markus; Hliněný, Petr; Mutzel, Petra
1
2009
Finding branch-decompositions and rank-decompositions. Zbl 1163.05331
Hliněný, Petr; Oum, Sang-Il
42
2008
The crossing number of a projective graph is quadratic in the face-width. Zbl 1159.05016
Gitler, I.; Hlineny, P.; Leaños, J.; Salazar, G.
4
2008
Stars and bonds in crossing-critical graphs. Zbl 1267.05089
Hliněný, Petr; Salazar, Gelasio
1
2008
New infinite families of almost-planar crossing-critical graphs. Zbl 1165.05322
Hlineny, Petr
1
2008
Approximating the crossing number of toroidal graphs. Zbl 1193.05116
Hliněný, Petr; Salazar, Gelasio
7
2007
On the crossing number of almost planar graphs. Zbl 1185.68485
Hliněný, Petr; Salazar, Gelasio
7
2007
Finding branch-decompositions and rank-decompositions. Zbl 1151.05046
Hliněný, Petr; Oum, Sang-il
3
2007
Some hard problems on matroid spikes. Zbl 1126.05030
Hliněný, Petr
3
2007
The crossing number of a projective graph is quadratic in the face-width. Zbl 1341.05040
Gitler, Isidoro; Hliněný, Petr; Leaños, Jesus; Salazar, Gelasio
2
2007
Crossing number is hard for cubic graphs. Zbl 1092.05016
Hliněný, Petr
13
2006
Branch-width, parse trees, and monadic second-order logic for matroids. Zbl 1088.05022
Hliněný, Petr
12
2006
Matroid tree-width. Zbl 1103.05019
Hliněný, Petr; Whittle, Geoff
10
2006
Computing the Tutte polynomial on graphs of bounded clique-width. Zbl 1126.05092
Giménez, Omer; Hliněný, Petr; Noy, Marc
5
2006
The Tutte polynomial for matroids of bounded branch-width. Zbl 1095.05009
Hliněný, Petr
4
2006
Balanced signings and the chromatic number of oriented matroids. Zbl 1119.52016
Goddyn, Luis; Hliněný, Petr; Hochstättler, Winfried
3
2006
Trees, grids, and MSO decidability: from graphs to matroids. Zbl 1093.03006
Hliněný, Petr; Seese, Detlef
3
2006
On matroid representability and minor problems. Zbl 1132.05310
Hliněný, Petr
2
2006
A parametrized algorithm for matroid branch-width. Zbl 1088.05023
Hliněný, Petr
7
2005
Bridging separations in matroids. Zbl 1069.05017
Geelen, Jim; Hliněný, Petr; Whittle, Geoff
4
2005
Computing the Tutte polynomial on graphs of bounded clique-width. Zbl 1126.05302
Giménez, Omer; Hliněný, Petr; Noy, Marc
3
2005
On possible counterexamples to Negami’s planar cover conjecture. Zbl 1049.05028
Hliněný, Petr; Thomas, Robin
7
2004
Using a computer in matroid theory research. Zbl 1063.05030
Hliněný, Petr
2
2004
On decidability of MSO theories of representable matroids. Zbl 1104.03007
Hliněný, Petr; Seese, Detlef
1
2004
Crossing number is hard for cubic graphs. Zbl 1097.68047
Hliněný, Petr
1
2004
Crossing-number critical graphs have bounded path-width. Zbl 1021.05028
Hliněny, Petr
10
2003
On matroid properties definable in the MSO logic. Zbl 1124.68373
Hliněný, Petr
7
2003
Branch-width, parse trees, and monadic second-order logic for matroids. Zbl 1035.05029
Hliněný, Petr
1
2003
On the excluded minors for matroids of branch-width three. Zbl 1003.05029
Hliněný, Petr
3
2002
Crossing-critical graphs and path-width. Zbl 1054.68590
Hliněný, Petr
1
2002
Representing graphs by disks and balls (a survey of recognition-complexity results). Zbl 0969.68118
Hliněný, Petr; Kratochvíl, Jan
14
2001
Contact graphs of line segments are NP-complete. Zbl 0982.05083
Hliněný, Petr
3
2001
Another two graphs with no planar covers. Zbl 0992.05035
Hliněný, Petr
1
2001
An addition to art galleries with interior walls. Zbl 0986.52005
Hliněný, P.
1
2001
A note on possible extensions of Negami’s conjecture. Zbl 0934.05105
Hliněný, Petr
3
1999
\(K_{4,4}-e\) has no finite planar cover. Zbl 0892.05039
Hliněný, Petr
6
1998
Classes and recognition of curve contact graphs. Zbl 0943.05069
Hliněný, Petr
5
1998
The maximal clique and colourability of curve contact graphs. Zbl 0898.05025
Hliněný, Petr
3
1998
Compuational complexity of the Krausz dimension of graphs. Zbl 0890.68094
Hliněnýi, Petr; Kratochvíl, Jan
2
1997
all top 5

Cited by 395 Authors

28 Hliněný, Petr
20 Ganian, Robert
11 Szeider, Stefan
10 Ordyniak, Sebastian
9 Kanté, Mamadou Moustapha
9 Nešetřil, Jaroslav
9 Rossmanith, Peter
8 Chimani, Markus
8 Courcelle, Bruno
8 Kwon, Ojoung
8 Ossona de Mendez, Patrice
8 Oum, Sang-Il
8 Salazar, Gelasio
6 Eiben, Eduard
6 Jansen, Bart M. P.
6 Obdržálek, Jan
6 Sikdar, Somnath
6 Telle, Jan Arne
6 Whittle, Geoffrey P.
5 Kobourov, Stephen G.
5 Langer, Alexander
5 Mutzel, Petra
5 Reidl, Felix
5 Thilikos, Dimitrios M.
4 Fomin, Fedor V.
4 Golovach, Petr A.
4 Kneis, Joachim
4 Kratochvíl, Jan
4 Kreutzer, Stephan
4 Pilipczuk, Michał
4 Vatshelle, Martin
3 Adler, Isolde
3 Bergougnoux, Benjamin
3 Biedl, Therese C.
3 Bui-Xuan, Binh-Minh
3 Derka, Martin
3 Downey, Rodney Graham
3 Eppstein, David Arthur
3 Fiala, Jiří
3 Fishkin, Aleksei V.
3 Geelen, Jim
3 Gurski, Frank
3 Hochstättler, Winfried
3 Kaufmann, Michael
3 Lokshtanov, Daniel
3 Meister, Daniel
3 Paulusma, Daniël
3 Pilipczuk, Marcin
3 Ramanujan, M. S.
3 Sau, Ignasi
3 Saurabh, Saket
3 Thomas, Robin
3 van Zwam, Stefan H. M.
2 Abu-Khzam, Faisal N.
2 Alam, Muhammad Jawaherul
2 Averbouch, Ilia
2 Bezdek, Károly
2 Bokal, Drago
2 Bougeret, Marin
2 Broersma, Hajo J.
2 Cabello, Sergio
2 Caragiannis, Ioannis
2 Clancy, Kieran
2 De Oliveira Oliveira, Mateus
2 Durand, Irène A.
2 Faria, Luerbio
2 Galby, Esther
2 Giannopoulou, Archontia C.
2 Godlin, Benny
2 Grohe, Martin
2 Hanaka, Tesshu
2 Haythorpe, Michael
2 Hosseini, Lucas
2 Huang, Yuanqiu
2 Hunter, Paul
2 Jansen, Klaus
2 Kaklamanis, Christos
2 Klavík, Pavel
2 Koutecký, Martin
2 Koutsonas, Athanassios
2 Král’, Daniel
2 Lampis, Michael
2 Li, Shouwei
2 Maack, Marten
2 Makowsky, Johann-Andreas
2 Markarian, Christine
2 Mayhew, Dillon
2 Mazoit, Frédéric
2 Meyer auf der Heide, Friedhelm
2 Milanič, Martin
2 Mitsou, Valia
2 Mohar, Bojan
2 Müller, Tobias M.
2 Newcombe, Alex
2 Nishimura, Naomi
2 Nisse, Nicolas
2 Ono, Hirotaka
2 Papaioannou, Evi
2 Patel, Viresh
2 Pendavingh, Rudi A.
...and 295 more Authors
all top 5

Cited in 47 Serials

30 Discrete Applied Mathematics
23 Theoretical Computer Science
23 European Journal of Combinatorics
20 Journal of Combinatorial Theory. Series B
19 Algorithmica
12 Discrete Mathematics
9 SIAM Journal on Discrete Mathematics
7 Journal of Computer and System Sciences
5 Graphs and Combinatorics
5 Journal of Combinatorial Optimization
4 Journal of Graph Theory
4 Theory of Computing Systems
4 Discrete Optimization
3 Advances in Applied Mathematics
3 Computer Science Review
2 Information Processing Letters
2 Discrete & Computational Geometry
2 Computational Geometry
2 The Electronic Journal of Combinatorics
2 Journal of Graph Algorithms and Applications
1 Artificial Intelligence
1 Communications in Mathematical Physics
1 Journal of Mathematical Physics
1 Archiv der Mathematik
1 Journal of Geometry
1 The Journal of Symbolic Logic
1 Memoirs of the American Mathematical Society
1 SIAM Journal on Computing
1 Transactions of the American Mathematical Society
1 Information and Computation
1 Journal of Parallel and Distributed Computing
1 International Journal of Foundations of Computer Science
1 Geometric and Functional Analysis. GAFA
1 European Journal of Operational Research
1 Journal of Knot Theory and its Ramifications
1 Combinatorics, Probability and Computing
1 Journal of Scheduling
1 Annals of Combinatorics
1 Discrete Mathematics and Theoretical Computer Science. DMTCS
1 RAIRO. Theoretical Informatics and Applications
1 ACM Transactions on Computational Logic
1 Journal of Discrete Algorithms
1 Journal of Applied Logic
1 Frontiers of Mathematics in China
1 Logical Methods in Computer Science
1 Algorithms
1 Philosophical Transactions of the Royal Society of London. A. Mathematical, Physical and Engineering Sciences

Citations by Year