Tomás Vyskocil

27 papers A 4B 3C 1Journal 15Unranked 4
YearRankTypeTitle / Venue / Authors
2019 — conf
Constraint Embedding for Solving Optimization Problems on Quantum Annealers.
IPDPS Workshops
Tomás Vyskocil, Hristo N. Djidjev
2019 J jnl
Embedding Equality Constraints of Optimization Problems into a Quantum Annealer.
Algorithms
Tomás Vyskocil, Hristo N. Djidjev
2018 — conf
Simple Constraint Embedding for Quantum Annealers.
ICRC
Tomás Vyskocil, Hristo N. Djidjev
2017 — conf
Embedding Inequality Constraints for Quantum Annealing Optimization.
QTOP@NetSys
Tomás Vyskocil, Scott Pakin, Hristo N. Djidjev
2017 J jnl
Extending Partial Representations of Interval Graphs.
Algorithmica
Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil
2017 J jnl
Extending Partial Representations of Proper and Unit Interval Graphs.
Algorithmica
Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil
2017 J jnl
Irreversible 2-conversion set in graphs of bounded degree.
Discret. Math. Theor. Comput. Sci.
Jan Kyncl, Bernard Lidický, Tomás Vyskocil
2017 J jnl
MSOL restricted contractibility to planar graphs.
Theor. Comput. Sci.
James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil
2017 A conf
The Moser-Tardos Resample algorithm: Where is the limit? (an experimental inquiry).
ALENEX
Jan Dean Catarata, Scott Corbett, Harry Stern, Mario Szegedy, Tomás Vyskocil, Zheng Zhang
2014 — conf
Extending Partial Representations of Proper and Unit Interval Graphs.
SWAT
Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil
2014 J jnl
Irreversible 2-conversion set in graphs of bounded degree.
CoRR
Jan Kyncl, Bernard Lidický, Tomás Vyskocil
2013 J jnl
Linear-time Algorithm for Partial Representation Extension of Interval Graphs.
CoRR
Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil
2013 J jnl
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree.
Graphs Comb.
Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil
2012 J jnl
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
CoRR
Steven Chaplick, Vít Jelínek, Jan Kratochvíl, Tomás Vyskocil
2012 B conf
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill.
WG
Steven Chaplick, Vít Jelínek, Jan Kratochvíl, Tomás Vyskocil
2012 J jnl
Extending Partial Representations of Proper and Unit Interval Graphs
CoRR
Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil
2012 B conf
MSOL Restricted Contractibility to Planar Graphs.
IPEC
James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil
2012 J jnl
Matching and l-Subgraph Contractibility to Planar Graphs
CoRR
James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil
2012 J jnl
Segment representation of a subclass of co-planar graphs.
Discret. Math.
Mathew C. Francis, Jan Kratochvíl, Tomás Vyskocil
2011 C conf
Extending Partial Representations of Interval Graphs.
TAMC
Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil
2010 B conf
Faithful Representations of Graphs by Islands in the Extended Grid.
LATIN
Michael D. Coury, Pavol Hell, Jan Kratochvíl, Tomás Vyskocil
2010 J jnl
Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case.
ACM Trans. Comput. Theory
Jan Kyncl, Tomás Vyskocil
2009 J jnl
Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs.
J. Graph Algorithms Appl.
Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil
2009 J jnl
Logspace reduction of directed reachability for bounded genus graphs to the planar case.
Electron. Colloquium Comput. Complex.
Jan Kyncl, Tomás Vyskocil
2009 A conf
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree.
GD
Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil
2008 A conf
Clustered Planarity: Clusters with Few Outgoing Edges.
GD
Vít Jelínek, Ondrej Suchý, Marek Tesar, Tomás Vyskocil
2007 A conf
Clustered Planarity: Small Clusters in Eulerian Graphs.
GD
Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil