default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomás Vyskocil
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j9]Tomás Vyskocil
, Hristo N. Djidjev:
Embedding Equality Constraints of Optimization Problems into a Quantum Annealer. Algorithms 12(4): 77 (2019)- [c12]Tomás Vyskocil, Hristo N. Djidjev:
Constraint Embedding for Solving Optimization Problems on Quantum Annealers. IPDPS Workshops 2019: 635-644 - 2018
- [c11]Tomás Vyskocil, Hristo N. Djidjev:
Simple Constraint Embedding for Quantum Annealers. ICRC 2018: 1-11 - 2017
- [j8]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil:
Extending Partial Representations of Proper and Unit Interval Graphs. Algorithmica 77(4): 1071-1104 (2017) - [j7]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil:
Extending Partial Representations of Interval Graphs. Algorithmica 78(3): 945-967 (2017) - [j6]Jan Kyncl, Bernard Lidický, Tomás Vyskocil:
Irreversible 2-conversion set in graphs of bounded degree. Discret. Math. Theor. Comput. Sci. 19(3) (2017) - [j5]James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil:
MSOL restricted contractibility to planar graphs. Theor. Comput. Sci. 676: 1-14 (2017) - [c10]Jan Dean Catarata, Scott Corbett, Harry Stern, Mario Szegedy, Tomás Vyskocil, Zheng Zhang:
The Moser-Tardos Resample algorithm: Where is the limit? (an experimental inquiry). ALENEX 2017: 159-171 - [c9]Tomás Vyskocil, Scott Pakin, Hristo N. Djidjev:
Embedding Inequality Constraints for Quantum Annealing Optimization. QTOP@NetSys 2017: 11-22 - 2014
- [c8]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil:
Extending Partial Representations of Proper and Unit Interval Graphs. SWAT 2014: 253-264 - [i6]Jan Kyncl, Bernard Lidický, Tomás Vyskocil:
Irreversible 2-conversion set in graphs of bounded degree. CoRR abs/1412.4188 (2014) - 2013
- [j4]Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil:
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. Graphs Comb. 29(4): 981-1005 (2013) - [i5]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil:
Linear-time Algorithm for Partial Representation Extension of Interval Graphs. CoRR abs/1306.2182 (2013) - 2012
- [j3]Mathew C. Francis, Jan Kratochvíl, Tomás Vyskocil:
Segment representation of a subclass of co-planar graphs. Discret. Math. 312(10): 1815-1818 (2012) - [c7]James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil:
MSOL Restricted Contractibility to Planar Graphs. IPEC 2012: 194-205 - [c6]Steven Chaplick, Vít Jelínek, Jan Kratochvíl, Tomás Vyskocil:
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill. WG 2012: 274-285 - [i4]James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil:
Matching and l-Subgraph Contractibility to Planar Graphs. CoRR abs/1204.6070 (2012) - [i3]Steven Chaplick, Vít Jelínek, Jan Kratochvíl, Tomás Vyskocil:
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill. CoRR abs/1206.5159 (2012) - [i2]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil:
Extending Partial Representations of Proper and Unit Interval Graphs. CoRR abs/1207.6960 (2012) - 2011
- [c5]Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil:
Extending Partial Representations of Interval Graphs. TAMC 2011: 276-285 - 2010
- [j2]Jan Kyncl, Tomás Vyskocil:
Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case. ACM Trans. Comput. Theory 1(3): 8:1-8:11 (2010) - [c4]Michael D. Coury, Pavol Hell, Jan Kratochvíl, Tomás Vyskocil:
Faithful Representations of Graphs by Islands in the Extended Grid. LATIN 2010: 131-142
2000 – 2009
- 2009
- [j1]Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil:
Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs. J. Graph Algorithms Appl. 13(3): 379-422 (2009) - [c3]Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil:
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. GD 2009: 304-315 - [i1]Jan Kyncl, Tomás Vyskocil:
Logspace reduction of directed reachability for bounded genus graphs to the planar case. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c2]Vít Jelínek, Ondrej Suchý, Marek Tesar, Tomás Vyskocil:
Clustered Planarity: Clusters with Few Outgoing Edges. GD 2008: 102-113 - 2007
- [c1]Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil:
Clustered Planarity: Small Clusters in Eulerian Graphs. GD 2007: 303-314
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
