Tomas Vyskocil
Tomas Vyskocil
Charles University, Rutgers University
Email verificata su
Citata da
Citata da
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
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
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
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
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
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
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
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
Irreversible 2-conversion set in graphs of bounded degree
J Kynčl, B Lidický, T Vyskočil
arXiv preprint arXiv:1412.4188, 2014
Irrecersible 2-conversion Set is NP-complete
J Kyncl, B Lidiký, T Vyskocil
Charles Univ, 2009
Simple constraint embedding for quantum annealers
T Vyskocil, H Djidjev
2018 IEEE International Conference on Rebooting Computing (ICRC), 1-11, 2018
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
Embedding equality constraints of optimization problems into a quantum annealer
T Vyskocil, H Djidjev
Algorithms 12 (4), 77, 2019
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
Segment representation of a subclass of co-planar graphs
MC Francis, J Kratochvíl, T Vyskočil
Discrete Mathematics 312 (10), 1815-1818, 2012
Matching and ℓ-Subgraph Contractibility to Planar Graphs⋆
J Abello, P Klavık, J Kratochvıl, T Vyskocil
arXiv preprint arXiv:1204.6070, 2012
Faithful Representations of Graphs by Islands in the Extended Grid
MD Coury, P Hell, T Vyskocil, J Kratochvıl
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
Constraint embedding for solving optimization problems on quantum annealers
T Vyskocil, H Djidjev
2019 IEEE International Parallel and Distributed Processing Symposium …, 2019
Graph Drawing: Visualisation and Geometric Representations of Graphs and Networks
T Vyskočil
Univerzita Karlova, Matematicko-fyzikální fakulta, 2015
Il sistema al momento non puň eseguire l'operazione. Riprova piů tardi.
Articoli 1–20