default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 423
Volume 423, March 2012
- 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
- 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-16 22:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
