Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Verbitsky, Oleg"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the speed of constraint propagation and the time complexity of arc consistency testing
Christoph Berkholz
,
Oleg Verbitsky
Lecture Notes in Computer Science
8087
, 2013, pp. 159-170
Helly circular-arc graph isomorphism is in logspace
Johannes Köbler
,
Sebastian Kuhnert
,
Oleg Verbitsky
Lecture Notes in Computer Science
8087
, 2013, pp. 631-642
Solving the canonical representation and star system problems for proper circular-arc graphs in logspace
Johannes Köbler
,
Sebastian Kuhnert
,
Oleg Verbitsky
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 387-399
Interval graphs: Canonical representations in logspace
Johannes Köbler
,
Sebastian Kuhnert
,
Bastian Laubner
,
Oleg Verbitsky
SIAM Journal on Computing
40
(5), 2011, pp. 1292-1315
On collinear sets in straight-line drawings
Alexander Ravsky
,
Oleg Verbitsky
Lecture Notes in Computer Science
6986
, 2011, pp. 295-306
Interval graphs: Canonical representation in logspace
Johannes Köbler
,
Sebastian Kuhnert
,
Bastian Laubner
,
Oleg Verbitsky
Lecture Notes in Computer Science
6198
, 2010, pp. 384-395
On the obfuscation complexity of planar graphs
Oleg Verbitsky
Theoretical Computer Science
396
(1-3), 2008, pp. 294-300
On the computational complexity of the forcing chromatic number
Frank Harary
,
Wolfgang Slany
,
Oleg Verbitsky
SIAM Journal on Computing
37
(1), 2007, pp. 1-19
Planar graphs: Logical complexity and parallel isomorphism tests
Oleg Verbitsky
Lecture Notes in Computer Science
4393
, 2007, pp. 682-693
Testing graph isomorphism in parallel by playing a game
Martin Grohe
,
Oleg Verbitsky
Lecture Notes in Computer Science
4051
, 2006, pp. 3-14
On the computational complexity of the forcing chromatic number
Frank Harary
,
Wolfgang Slany
,
Oleg Verbitsky
Lecture Notes in Computer Science
3404
, 2005, pp. 182-193
The first order definability of graphs with separators via the Ehrenfeucht game
Oleg Verbitsky
Theoretical Computer Science
343
(1-2), 2005, pp. 158-176
Error reduction by parallel repetition - A negative result
Uriel Feige
,
Oleg Verbitsky
Combinatorica
22
(4), 2002, pp. 461-478
Remarks on a query-based variant of the parallel repetition theorem
Oleg Verbitsky
International Journal of Foundations of Computer Science
12
(4), 2001, pp. 517-531
Arthur-Merlin games in Boolean decision trees
Ran Raz
,
Gábor Tardos
,
Oleg Verbitsky
,
Nikolai Vereshchagin
Journal of Computer and System Sciences
59
(2), 1999, pp. 346-372
Arthur-Merlin games in boolean decision trees
Ran Raz
,
Gábor Tardos
,
Oleg Verbitsky
,
Nikolai Vereshagin
Proceedings of the 13th Annual IEEE Conference on Computational Complexity (Buffalo, New York, June 15-18, 1998)
, 1998, pp. 58-67
Error reduction by parallel repetition - a negative result
Uriel Feige
,
Oleg Verbitsky
Proceedings of the 11th Annual IEEE Conference on Computational Complexity (Philadelphia, Pennsylvania, May 24-27, 1996)
, 1996, pp. 70-76
Towards the parallel repetition conjecture
Oleg Verbitsky
Theoretical Computer Science
157
(2), 1996, pp. 277-282
The parallel repetition conjecture for trees is true
Oleg Verbitsky
Technical Report (TR95-013), 1995
Towards the parallel repetition conjecture
Oleg Verbitsky
Proceedings of the Ninth Annual Conference on Structure in Complexity Theory (Amsterdam, The Netherlands, June 28 - July 1, 1994)
, 1994, pp. 304-307