30. ICALP 2003:
Eindhoven,
The Netherlands
Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger (Eds.):
Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings.
Lecture Notes in Computer Science 2719 Springer 2003, ISBN 3-540-40493-7 BibTeX
@proceedings{DBLP:conf/icalp/2003,
editor = {Jos C. M. Baeten and
Jan Karel Lenstra and
Joachim Parrow and
Gerhard J. Woeginger},
title = {Automata, Languages and Programming, 30th International Colloquium,
ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003.
Proceedings},
booktitle = {ICALP},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2719},
year = {2003},
isbn = {3-540-40493-7},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Lectures
Algorithms
Process Algebra
Approximation Algorithms
- Alexander A. Ageev, Yinyu Ye, Jiawei Zhang:
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem.
145-156
Electronic Edition (Springer LINK) BibTeX
- Markus Bläser:
An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality.
157-163
Electronic Edition (Springer LINK) BibTeX
- Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan:
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities.
164-175
Electronic Edition (Springer LINK) BibTeX
- Sanjeev Arora, Kevin L. Chang:
Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem.
176-188
Electronic Edition (Springer LINK) BibTeX
- Chandra Chekuri, Sudipto Guha, Joseph Naor:
Approximating Steiner k-Cuts.
189-199
Electronic Edition (Springer LINK) BibTeX
- Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani:
MAX k-CUT and Approximating the Chromatic Number of Random Graphs.
200-211
Electronic Edition (Springer LINK) BibTeX
- Michael Elkin, Guy Kortsarz:
Approximation Algorithm for Directed Telephone Multicast Problem.
212-223
Electronic Edition (Springer LINK) BibTeX
Languages and Programming
Complexity
Data Structures
Graph Algorithms
Automata
Optimization and Games
- Eyal Even-Dar, Alexander Kesselman, Yishay Mansour:
Convergence Time to Nash Equilibria.
502-513
Electronic Edition (Springer LINK) BibTeX
- Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode:
Nashification and the Coordination Ratio for a Selfish Routing Game.
514-526
Electronic Edition (Springer LINK) BibTeX
- Vipul Bansal, Aseem Agrawal, Varun S. Malhotra:
Stable Marriages with Multiple Partners: Efficient Search for an Optimal Solution.
527-542
Electronic Edition (Springer LINK) BibTeX
- Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
An Intersection Inequality for Discrete Distributions and Related Generation Problems.
543-555
Electronic Edition (Springer LINK) BibTeX
Graphs and Bisimulation
Online Problems
Verification
Around the Internet
Temporal Logic and Model Checking
Graph Problems
- Luisa Gargano, Mikael Hammar:
There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them).
802-816
Electronic Edition (Springer LINK) BibTeX
- Jirí Fiala, Daniël Paulusma:
The Computational Complexity of the Role Assignment Problem.
817-828
Electronic Edition (Springer LINK) BibTeX
- Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs.
829-844
Electronic Edition (Springer LINK) BibTeX
- Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia:
Genus Characterizes the Complexity of Graph Problems: Some Tight Results.
845-856
Electronic Edition (Springer LINK) BibTeX
Logic and Lambda-Calculus
Data Structures and Algorithms
Types and Categories
Probabilistic Systems
Sampling and Randomness
Scheduling
Geometric Problems
Copyright © Sat May 16 23:16:06 2009
by Michael Ley (ley@uni-trier.de)
