Tomás Vyskocil

According to our database, Tomás Vyskocil authored at least 20 papers between 2007 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Embedding Equality Constraints of Optimization Problems into a Quantum Annealer.

Tomás Vyskocil, Hristo N. Djidjev

Algorithms, 2019

Constraint Embedding for Solving Optimization Problems on Quantum Annealers.

Tomás Vyskocil, Hristo N. Djidjev

Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2019

2018

Simple Constraint Embedding for Quantum Annealers.

Tomás Vyskocil, Hristo N. Djidjev

Proceedings of the 2018 IEEE International Conference on Rebooting Computing, 2018

2017

MSOL restricted contractibility to planar graphs.

James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil

Theor. Comput. Sci., 2017

Irreversible 2-conversion set in graphs of bounded degree.

Jan Kyncl, Bernard Lidický, Tomás Vyskocil

Discret. Math. Theor. Comput. Sci., 2017

Extending Partial Representations of Interval Graphs.

Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil

Algorithmica, 2017

Extending Partial Representations of Proper and Unit Interval Graphs.

Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil

Algorithmica, 2017

Embedding Inequality Constraints for Quantum Annealing Optimization.

Tomás Vyskocil, Scott Pakin, Hristo N. Djidjev

Proceedings of the Quantum Technology and Optimization Problems, 2017

The Moser-Tardos Resample algorithm: Where is the limit? (an experimental inquiry).

Jan Dean Catarata, Scott Corbett, Harry Stern, Mario Szegedy, Tomás Vyskocil, Zheng Zhang

Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2013

The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree.

Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil

Graphs Comb., 2013

Linear-time Algorithm for Partial Representation Extension of Interval Graphs.

Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil

CoRR, 2013

2012

Segment representation of a subclass of co-planar graphs.

Mathew C. Francis, Jan Kratochvíl, Tomás Vyskocil

Discret. Math., 2012

Matching and l-Subgraph Contractibility to Planar Graphs

James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil

CoRR, 2012

Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill.

Steven Chaplick, Vít Jelínek, Jan Kratochvíl, Tomás Vyskocil

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011

Extending Partial Representations of Interval Graphs.

Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil

Proceedings of the Theory and Applications of Models of Computation, 2011

2010

Faithful Representations of Graphs by Islands in the Extended Grid.

Michael D. Coury, Pavol Hell, Jan Kratochvíl, Tomás Vyskocil

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs.

Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil

J. Graph Algorithms Appl., 2009

Logspace reduction of directed reachability for bounded genus graphs to the planar case.

Jan Kyncl, Tomás Vyskocil

Electron. Colloquium Comput. Complex., 2009

2008

Clustered Planarity: Clusters with Few Outgoing Edges.

Vít Jelínek, Ondrej Suchý, Marek Tesar, Tomás Vyskocil

Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007

Clustered Planarity: Small Clusters in Eulerian Graphs.

Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil

Proceedings of the Graph Drawing, 15th International Symposium, 2007