Please note that eDoc will be permanently shut down in the first quarter of 2021!      Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Display Documents


Institute:
Collection:
Print in Citation style Print version     Display:
Sort by: Display records with Fulltext only
Entries: 1-10  
 Basket 
Approximation Algorithms for the Interval Constrained Coloring Problem
Authors: Althaus, Ernst; Canzar, Stefan; Elbassioni, Khaled; Karrenbauer, Andreas; Mestre, Julian
Date of Publication (YYYY-MM-DD): 2011
Title of Journal: Algorithmica
Volume: 61
Issue / Number: 2
Start Page: 342
End Page: 361
Document Type: Article
ID: 618728.0
A QPTAS for {TSP} with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
Authors: Chan, T.-H. Hubert; Elbassioni, Khaled
Date of Publication (YYYY-MM-DD): 2011
Title of Journal: Discrete & Computational Geometry
Volume: 46
Issue / Number: 4
Start Page: 704
End Page: 723
Document Type: Article
ID: 618726.0
Enumerating Minimal Transversals of Geometric Hypergraphs
Authors: Elbassioni, Khaled; Rauf, Imran; Ray, Saurabh
Place of Publication: Toronto
Publisher: CCCG
Date of Publication (YYYY-MM-DD): 2011
Title of Proceedings: 23rd Canadian Conference on Computational Geometry (CCCG 2011)
Start Page: 437
End Page: 442
Document Type: Conference-Paper
ID: 618737.0
Finding Simplices containing the Origin in Two and Three Dimensions
Authors: Elbassioni, Khaled; Elmasry, Amr; Makino, Kazuhisa
Date of Publication (YYYY-MM-DD): 2011
Title of Journal: International Journal of Computational Geometry & Applications
Volume: 21
Issue / Number: 5
Start Page: 495
End Page: 506
Document Type: Article
ID: 618725.0
Improved Approximations for Guarding 1.5-Dimensional Terrains
Authors: Elbassioni, Khaled; Krohn, Erik; Matijevic, Domagoj; Mestre, Julian; Severdija, Domagoj
Date of Publication (YYYY-MM-DD): 2011
Title of Journal: Algorithmica
Volume: 60
Issue / Number: 2
Start Page: 451
End Page: 463
Document Type: Article
ID: 618729.0
On a cone covering problem
Authors: Elbassioni, Khaled; Tiwary, Hans Raj
Date of Publication (YYYY-MM-DD): 2011
Title of Journal: Computational Geometry
Volume: 44
Issue / Number: 3
Start Page: 129
End Page: 134
Document Type: Article
ID: 618655.0
On the readability of monotone Boolean formulae
Authors: Elbassioni, Khaled; Makino, Kazuhisa; Rauf, Imran
Date of Publication (YYYY-MM-DD): 2011
Title of Journal: Journal of Combinatorial Optimization
Volume: 22
Issue / Number: 3
Start Page: 293
End Page: 304
Document Type: Article
ID: 618645.0
On Tree-Constrained Matchings and Generalizations
Authors: Canzar, Stefan; Elbassioni, Khaled; Klau, Gunnar W.; Mestre, Julian
Place of Publication: Berlin
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2011
Title of Proceedings: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011
Start Page: 98
End Page: 109
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 618724.0
Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
Authors: Boros, Endre; Elbassioni, Khaled; Fouz, Mahmoud; Gurvich, Vladimir; Makino, Kazuhisa; Manthey, Bodo
Place of Publication: Berlin
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2011
Title of Proceedings: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011
Start Page: 147
End Page: 158
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 618723.0
The negative cycles polyhedron and hardness of checking some polyhedral properties
Authors: Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Tiwary, Hans Raj
Date of Publication (YYYY-MM-DD): 2011
Title of Journal: Annals of Operations Research
Volume: 188
Issue / Number: 1
Start Page: 63
End Page: 76
Document Type: Article
ID: 618727.0
Entries: 1-10  
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.