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="Elbassioni, Khaled"
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
Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
Hans Raj Tiwary
,
Khaled Elbassioni
Graphs and Combinatorics
30
(3), 2014, pp. 729-742
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
On randomized fictitious play for approximating saddle points over convex sets
Khaled Elbassioni
,
Kazuhisa Makino
,
Kurt Mehlhorn
,
Fahimeh Ramezani
Lecture Notes in Computer Science
7936
, 2013, pp. 65-76
Charge group partitioning in biomolecular simulation
Stefan Canzar
,
Mohammed El-Kebir
,
René Pool
,
Khaled Elbassioni
,
Alpesh K. Malde
,
Alan E. Mark
,
Daan P. Geerke
Lecture Notes in Computer Science
7262
, 2012, pp. 29-43
Approximation algorithms for the unsplittable flow problem on paths and trees
Khaled Elbassioni
,
Naveen Garg
,
Divya Gupta
,
Amit Kumar
,
Vishal Narula
,
Arindam Pal
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 267-275
The relation of Connected Set Cover and Group Steiner Tree
Khaled Elbassioni
,
Slobodan Jelić
,
Domagoj Matijević
Theoretical Computer Science
438
, 2012, pp. 96-101
On the complexity of the highway problem
Khaled Elbassioni
,
Rajiv Raman
,
Saurabh Ray
,
René Sitters
Theoretical Computer Science
460
, 2012, pp. 70-77
Complexity of approximating the vertex centroid of a polyhedron
Khaled Elbassioni
,
Hans Raj Tiwary
Theoretical Computer Science
421
, 2012, pp. 56-61
A QPTAS for
\epsilon
-envy-free profit-maximizing pricing on line graphs
Khaled Elbassioni
Lecture Notes in Computer Science
7392
, 2012, pp. 513-524
Simpler approximation of the maximum asymmetric Traveling Salesman Problem
Katarzyna Paluch
,
Khaled Elbassioni
,
Anke van Zuylen
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 501-506
Approximation algorithms for the interval constrained coloring problem
Ernst Althaus
,
Stefan Canzar
,
Khaled Elbassioni
,
Andreas Karrenbauer
,
Julián Mestre
Algorithmica
61
(2), 2011, pp. 342-361
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
On tree-constrained matchings and generalizations
Stefan Canzar
,
Khaled Elbassioni
,
Gunnar W. Klau
,
Julián Mestre
Lecture Notes in Computer Science
6755
, 2011, pp. 98-109
Improved approximations for guarding 1.5-dimensional terrains
Khaled Elbassioni
,
Erik Krohn
,
Domagoj Matijević
,
Julián Mestre
,
Domagoj S̑everdija
Algorithmica
60
(2), 2011, pp. 451-463
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
Left-to-right multiplication for monotone Boolean dualization
Endre Boros
,
Khaled Elbassioni
,
Kazuhisa Makino
SIAM Journal on Computing
39
(7), 2010, pp. 3424-3439
On the approximability of the Maximum Interval Constrained Coloring problem
Stefan Canzar
,
Khaled Elbassioni
,
Amr Elmasry
,
Rajiv Raman
Lecture Notes in Computer Science
6507
, 2010, pp. 168-179
Improved approximations for guarding 1.5-dimensional terrains
Khaled Elbassioni
,
Erik Krohn
,
Domagoj Matijević
,
Julián Mestre
,
Domagoj S̑everdija
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 361-372
On the readability of monotone Boolean formulae
Khaled Elbassioni
,
Kazuhisa Makino
,
Imran Rauf
Lecture Notes in Computer Science
5609
, 2009, pp. 496-505
Output-sensitive algorithms for enumerating minimal transversals for some geometric hypergraphs
Khaled Elbassioni
,
Kazuhisa Makino
,
Imran Rauf
Lecture Notes in Computer Science
5757
, 2009, pp. 143-154
Complexity of approximating the vertex centroid of a polyhedron
Khaled Elbassioni
,
Hans Raj Tiwary
Lecture Notes in Computer Science
5878
, 2009, pp. 413-422
Approximating the interval constrained coloring problem
Ernst Althaus
,
Stefan Canzar
,
Khaled Elbassioni
,
Andreas Karrenbauer
,
Julián Mestre
Lecture Notes in Computer Science
5124
, 2008, pp. 210-221
On Berge multiplication for monotone Boolean dualization
Endre Boros
,
Khaled Elbassioni
,
Kazuhisa Makino
Lecture Notes in Computer Science
5125
, 2008, pp. 48-59
Algorithms for dualization over products of partially ordered sets
Khaled M. Elbassioni
SIAM Journal on Discrete Mathematics
23
(1), 2008-2009, pp. 487-510
Seiten 1
2
3
>