| Extending partial representations of interval graphs P Klavík, J Kratochvíl, Y Otachi, T Saitoh, T Vyskočil Algorithmica 78, 945-967, 2017 | 74* | 2017 |
| Embedding inequality constraints for quantum annealing optimization T Vyskočil, S Pakin, HN Djidjev Quantum Technology and Optimization Problems: First International Workshop …, 2019 | 43 | 2019 |
| 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 | 43 | 2013 |
| Bend-bounded path intersection graphs: Sausages, noodles, and waffles on a grill S Chaplick, V Jelínek, J Kratochvíl, T Vyskočil Graph-Theoretic Concepts in Computer Science: 38th International Workshop …, 2012 | 38 | 2012 |
| Clustered planarity: Small clusters in cycles and Eulerian graphs E Jelínková, J Kára, J Kratochvíl, M Pergel, O Suchý, T Vyskocil Journal of Graph Algorithms and Applications 13 (3), 379-422, 2009 | 31 | 2009 |
| Embedding equality constraints of optimization problems into a quantum annealer T Vyskocil, H Djidjev Algorithms 12 (4), 77, 2019 | 28 | 2019 |
| 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 | 23 | 2010 |
| Clustered planarity: Clusters with few outgoing edges V Jelínek, O Suchý, M Tesař, T Vyskočil Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete …, 2009 | 19 | 2009 |
| 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 | 18 | 2007 |
| Irreversible 2-conversion set in graphs of bounded degree J Kynčl, B Lidický, T Vyskočil Discrete Mathematics & Theoretical Computer Science 19 (Graph Theory), 2017 | 16 | 2017 |
| 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 | 13 | 2017 |
| Irrecersible 2-conversion Set is NP-complete J Kyncl, B Lidiký, T Vyskocil Charles Univ, 2009 | 12 | 2009 |
| Simple constraint embedding for quantum annealers T Vyskocil, H Djidjev 2018 IEEE International Conference on Rebooting Computing (ICRC), 1-11, 2018 | 10 | 2018 |
| Segment representation of a subclass of co-planar graphs MC Francis, J Kratochvíl, T Vyskočil Discrete Mathematics 312 (10), 1815-1818, 2012 | 8 | 2012 |
| 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 | 7 | 2013 |
| Faithful Representations of Graphs by Islands in the Extended Grid MD Coury, P Hell, T Vyskocil, J Kratochvıl | 5* | |
| Constraint embedding for solving optimization problems on quantum annealers T Vyskocil, H Djidjev 2019 IEEE International Parallel and Distributed Processing Symposium …, 2019 | 4 | 2019 |
| Matching and ℓ-subgraph contractibility to planar graphs J Abello, P Klavık, J Kratochvıl, T Vyskocil arXiv preprint arXiv:1204.6070, 2012 | 2 | 2012 |
| 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 | 1 | 2012 |
| Graph Drawing: Visualisation and Geometric Representations of Graphs and Networks T Vyskočil Univerzita Karlova, Matematicko-fyzikální fakulta, 2015 | | 2015 |
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaDirección de correo verificada de kam.mff.cuni.cz
