Tomas Vyskocil
Tomas Vyskocil
Charles University, Rutgers University
Verified email at cs.rutgers.edu
Title
Cited by
Cited by
Year
Extending partial representations of interval graphs
P Klavík, J Kratochvíl, T Vyskočil
International Conference on Theory and Applications of Models of Computation …, 2011
50*2011
Clustered planarity: Small clusters in cycles and Eulerian graphs
E Jelınková, J Kára, J Kratochvıl, M Pergel, O Suchý, T Vyskocil
J. Graph Algorithms Appl 13 (3), 379-422, 2009
282009
The planar slope number of planar partial 3-trees of bounded degree
V Jelínek, E Jelínková, J Kratochvíl, B Lidický, M Tesař, T Vyskočil
Graphs and Combinatorics 29 (4), 981-1005, 2013
272013
Extending partial representations of proper and unit interval graphs
P Klavık, J Kratochvıl, Y Otachi, I Rutter, T Saitoh, M Saumell, T Vyskocil
SWAT, 253-264, 2014
252014
Bend-bounded path intersection graphs: Sausages, noodles, and waffles on a grill
S Chaplick, V Jelínek, J Kratochvíl, T Vyskočil
International Workshop on Graph-Theoretic Concepts in Computer Science, 274-285, 2012
232012
Clustered planarity: Clusters with few outgoing edges
V Jelínek, O Suchý, M Tesař, T Vyskočil
International Symposium on Graph Drawing, 102-113, 2008
172008
Logspace reduction of directed reachability for bounded genus graphs to the planar case
J Kynčl, T Vyskočil
ACM Transactions on Computation Theory (TOCT) 1 (3), 1-11, 2010
162010
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, 303-314, 2007
162007
Embedding inequality constraints for quantum annealing optimization
T Vyskočil, S Pakin, HN Djidjev
International workshop on quantum technology and optimization problems, 11-22, 2019
122019
Irreversible 2-conversion set in graphs of bounded degree
J Kynčl, B Lidický, T Vyskočil
arXiv preprint arXiv:1412.4188, 2014
102014
Irrecersible 2-conversion Set is NP-complete
J Kyncl, B Lidiký, T Vyskocil
Charles Univ, 2009
102009
Simple constraint embedding for quantum annealers
T Vyskocil, H Djidjev
2018 IEEE International Conference on Rebooting Computing (ICRC), 1-11, 2018
82018
The Moser-Tardos resample algorithm: Where is the limit?(an experimental inquiry)
JD Catarata, S Corbett, H Stern, M Szegedy, T Vyskocil, Z Zhang
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and …, 2017
72017
Linear-time algorithm for partial representation extension of interval graphs
P Klavík, J Kratochvíl, Y Otachi, T Saitoh, T Vyskocil
CoRR abs/1306.2182, 2013
62013
Segment representation of a subclass of co-planar graphs
MC Francis, J Kratochvíl, T Vyskočil
Discrete Mathematics 312 (10), 1815-1818, 2012
62012
Embedding equality constraints of optimization problems into a quantum annealer
T Vyskocil, H Djidjev
Algorithms 12 (4), 77, 2019
52019
Matching and ℓ-subgraph contractibility to planar graphs
J Abello, P Klavík, J Kratochvíl, T Vyskocil
arXiv preprint arXiv:1204.6070, 2012
32012
Faithful Representations of Graphs by Islands in the Extended Grid
MD Coury, P Hell, T Vyskocil, J Kratochvıl
3*
MSOL restricted contractibility to planar graphs
J Abello, P Klavík, J Kratochvíl, T Vyskočil
International Symposium on Parameterized and Exact Computation, 194-205, 2012
22012
Constraint Embedding for Solving Optimization Problems on Quantum Annealers
T Vyskocil, H Djidjev
2019 IEEE International Parallel and Distributed Processing Symposium …, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–20