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
[1]
Hilfe
Suche: Author="Gurvich, Vladimir"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Markov decision processes and stochastic games with total effective payoff
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
,
Kazuhisa Makino
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 103-115
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and a few random positions
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
,
Kazuhisa Makino
Lecture Notes in Computer Science
7965
, 2013, pp. 220-231
Stochastic mean payoff games: Smoothed analysis and approximation schemes
Endre Boros
,
Khaled Elbassioni
,
Mahmoud Fouz
,
Vladimir Gurvich
,
Kazuhisa Makino
,
Bodo Manthey
Lecture Notes in Computer Science
6755
, 2011, pp. 147-158
A pumping algorithm for ergodic stochastic mean payoff games with perfect information
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
,
Kazuhisa Makino
Lecture Notes in Computer Science
6080
, 2010, pp. 341-354
Friendship two-graphs
Endre Boros
,
Vladimir A. Gurvich
,
Igor E. Zverovich
Graphs and Combinatorics
26
(5), 2010, pp. 617-628
Neighborhood hypergraphs of bipartite graphs
Endre Boros
,
Vladimir Gurvich
,
Igor Zverovich
Journal of Graph Theory
58
(1), 2008, pp. 69-95
Generating cut conjunctions in graphs and related problems
Leonid Khachiyan
,
Endre Boros
,
Konrad Borys
,
Khaled Elbassioni
,
Vladimir Gurvich
,
Kazuhisa Makino
Algorithmica
51
(3), 2008, pp. 239-263
On short paths interdiction problems: Total and node-wise limited interdiction
Leonid Khachiyan
,
Endre Boros
,
Konrad Borys
,
Khaled Elbassioni
,
Vladimir Gurvich
,
Gabor Rudolph
,
Jihui Zhao
Theory of Computing Systems
43
(2), 2008, pp. 204-233
On enumerating minimal dicuts and strongly connected subgraphs
Leonid Khachiyan
,
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
Algorithmica
50
(1), 2008, pp. 159-172
Generating minimal
k
-vertex connected spanning subgraphs
Endre Boros
,
Konrad Borys
,
Khaled Elbassioni
,
Vladimir Gurvich
,
Kazuhisa Makino
,
Gabor Rudolf
Lecture Notes in Computer Science
4598
, 2007, pp. 222-231
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
Leonid Khachiyan
,
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
,
Kazuhisa Makino
Theoretical Computer Science
379
(3), 2007, pp. 361-376
A global parallel algorithm for the hypergraph transversal problem
Leonid Khachiyan
,
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
Information Processing Letters
101
(4), 2007, pp. 148-155
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
Leonid Khachiyan
,
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
Theoretical Computer Science
382
(2), 2007, pp. 139-150
Computing many maximal independent sets for hypergraphs in parallel
Leonid Khachiyan
,
Endre Boros
,
Vladimir Gurvich
,
Khaled Elbassioni
Parallel Processing Letters
17
(2), 2007, pp. 141-152
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
Journal of Graph Theory
53
(3), 2006, pp. 209-232
A new algorithm for the hypergraph transversal problem
Leonid Khachiyan
,
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
Lecture Notes in Computer Science
3595
, 2005, pp. 767-776
Generating paths and cuts in multi-pole (di)graphs
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
,
Leonid Khachiyan
,
Kazuhisa Makino
Lecture Notes in Computer Science
3153
, 2004, pp. 298-309
Algorithms for generating minimal blockers of perfect matchings in bipartite graphs and related problems
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
Lecture Notes in Computer Science
3221
, 2004, pp. 122-133
An intersection inequality for discrete distributions and related generation problems
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
,
Leonid Khachiyan
,
Kazuhisa Makino
Lecture Notes in Computer Science
2719
, 2003, pp. 543-555
Algorithms for enumerating circuits in matroids
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
,
Leonid Khachiyan
Lecture Notes in Computer Science
2906
, 2003, pp. 485-494
Matroid intersections, polymatroid inequalities, and related problems
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
,
Leonid Khachiyan
Lecture Notes in Computer Science
2420
, 2002, pp. 143-154
Dual-bounded generating problems: Partial and multiple transversals of a hypergraph
Endre Boros
,
Vladimir Gurvich
,
Leonid Khachiyan
,
Kazuhisa Makino
SIAM Journal on Computing
30
(6), 2001, pp. 2036-2050
Generating partial and multiple transversals of a hypergraph
Endre Boros
,
Vladimir Gurvich
,
Leonid Khachiyan
,
Kazuhisa Makino
Lecture Notes in Computer Science
1853
, 2000, pp. 588-599
On minimal imperfect graphs with circular symmetry
Gábor Bacsó
,
Endre Boros
,
Vladimir Gurvich
,
Frédéric Maffray
,
Myriam Preissmann
Journal of Graph Theory
29
(4), 1998, pp. 209-225
Decomposability of partially defined Boolean functions
Endre Boros
,
Vladimir Gurvich
,
Peter L. Hammer
,
Toshihide Ibaraki
,
Alexander Kogan
Discrete Applied Mathematics
62
, 1995, pp. 51-75