Ondra Suchý
Ondra Suchý
Assistant Professor of Theoretical Computer Science, Czech Technical University
Email verificata su fit.cvut.cz - Home page
Titolo
Citata da
Citata da
Anno
A multivariate complexity analysis of lobbying in multiple referenda
R Bredereck, J Chen, S Hartung, S Kratsch, R Niedermeier, O Suchy, ...
Journal of Artificial Intelligence Research 50, 409-446, 2014
362014
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
R Bredereck, J Chen, S Hartung, R Niedermeier, O Suchý, S Kratsch
26th Conference on Artificial Intelligence, AAAI 12, 1292-1298, 2012
362012
A refined complexity analysis of degree anonymization in graphs
S Hartung, A Nichterlein, R Niedermeier, O Suchý
Information and Computation 243, 249-262, 2015
312015
A Refined Complexity Analysis of Degree Anonymization on Graphs
S Hartung, A Nichterlein, R Niedermeier, O Suchý
International Colloqium on Automata, Languages and Programming, ICALP 2013 …, 2013
312013
Clustered planarity: Small clusters in cycles and Eulerian graphs
E Jelínková, J Kára, J Kratochvíl, M Pergel, O Suchý, T Vyskočil
J. Graph Algorithms Appl 13 (3), 379-422, 2009
302009
Parameterized complexity of arc-weighted directed Steiner problems
J Guo, R Niedermeier, O Suchý
SIAM Journal on Discrete Mathematics 25 (2), 583-599, 2011
282011
On structural parameterizations for the 2-club problem
S Hartung, C Komusiewicz, A Nichterlein, O Suchý
Discrete Applied Mathematics 185, 79-92, 2015
272015
Parameterized complexity of generalized domination problems
PA Golovach, J Kratochvíl, O Suchý
Discrete Applied Mathematics 160 (6), 780-792, 2012
242012
Parameterized complexity of generalized domination problems
PA Golovach, J Kratochvíl, O Suchý
35th International Workshop on Graph-Theoretic Concepts in Computer Science …, 2010
242010
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
R van Bevern, R Niedermeier, O Suchý
Journal of Scheduling 20 (3), 255-265, 2017
182017
What makes equitable connected partition easy
R Enciso, MR Fellows, J Guo, I Kanj, F Rosamond, O Suchý
International Workshop on Parameterized and Exact Computation, IWPEC 2009 …, 2009
182009
Clustered planarity: Clusters with few outgoing edges
V Jelínek, O Suchý, M Tesař, T Vyskočil
International Symposium on Graph Drawing, GD 2008 5417 (LNCS), 102-113, 2008
182008
Parameterized complexity of directed Steiner tree on sparse graphs
M Jones, D Lokshtanov, MS Ramanujan, S Saurabh, O Suchý
European Symposium on Algorithms, ESA 2013 8125 (LNCS), 671-682, 2013
172013
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem
J Chen, C Komusiewicz, R Niedermeier, M Sorge, O Suchý, M Weller
SIAM Journal on Discrete Mathematics 29 (1), 1-25, 2015
162015
Beyond Max-Cut: λ-extendible properties parameterized above the Poljak–Turzík bound
M Mnich, G Philip, S Saurabh, O Suchý
Journal of Computer and System Sciences 80 (7), 1384-1403, 2014
162014
Beyond Max-Cut: λ-extendible properties parameterized above the Poljak–Turzík bound
M Mnich, G Philip, S Saurabh, O Suchý
32nd Annual Conference on Foundations of Software Technology and Theoretical …, 2012
162012
Clustered planarity: Small clusters in Eulerian graphs
E Jelínková, J Kára, J Kratochvíl, M Pergel, O Suchý, T Vyskočil
International Symposium on Graph Drawing, GD 2007 4875 (LNCS), 303-314, 2007
162007
Tree Deletion Set Has a Polynomial Kernel (but No OPT^O(1) Approximation)
AC Giannopoulou, D Lokshtanov, S Saurabh, O Suchý
SIAM Journal on Discrete Mathematics 30 (3), 1371-1384, 2016
152016
Tree Deletion Set has a Polynomial Kernel (but no OPT^ O (1) approximation)
AC Giannopoulou, D Lokshtanov, S Saurabh, O Suchy
34th International Conference on Foundation of Software Technology and …, 2014
152014
The parameterized complexity of local search for TSP, more refined
J Guo, S Hartung, R Niedermeier, O Suchý
Algorithmica 67 (1), 89-110, 2013
152013
Il sistema al momento non puň eseguire l'operazione. Riprova piů tardi.
Articoli 1–20