Volume 423, March 2012
Contributions
- Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song:
Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time.
1-10
- Ho-Leung Chan, Nicole Megow, René Sitters, Rob van Stee:
A note on sorting buffers offline.
11-18
- Anna A. Gorbenko, Vladimir Yu. Popov:
The set of parameterized k-covers problem.
19-24
- Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin, Christophe Picouleau:
On the NP-completeness of the perfect matching free subgraph problem.
25-29
- Luís M. S. Russo:
Monge properties of sequence alignment.
30-49
- Tamir Tassa:
Finding all maximally-matchable edges in a bipartite graph.
50-58
- Rob van Stee:
An improved algorithm for online rectangle filling.
59-74
Erratum
- Amir M. Ben-Amram, Simon Yoffe:
Corrigendum to "A simple and efficient Union-Find-Delete algorithm" [Theoret. Comput. Sci. 412(4-5) 487-492].
75
Last update Sat May 18 20:57:13 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
