default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 526
Volume 526, March 2014
- Fedor V. Fomin
, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse:
To satisfy impatient Web surfers is hard. 1-17 - Alexander Golovnev, Konstantin Kutzkov:
New exact algorithms for the 2-constraint satisfaction problem. 18-27 - Jørgen Bang-Jensen, Stéphane Bessy:
(Arc-)disjoint flows in networks. 28-40 - Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
Counting spanning trees using modular decomposition. 41-57 - Gerth Stølting Brodal, Alexis C. Kaporis, Apostolos N. Papadopoulos, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas:
Dynamic 3-sided planar range queries with expected doubly-logarithmic time. 58-74 - Carla Binucci, Walter Didimo, Maurizio Patrignani:
Upward and quasi-upward planarity testing of embedded mixed graphs. 75-89 - Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh:
Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization. 90-96 - Daniel Genkin, Michael Kaminski, Liat Peterfreund:
A note on the emptiness problem for alternating finite-memory automata. 97-107 - Takahiro Ota, Hirotada Fukae, Hiroyoshi Morita:
Dynamic construction of an antidictionary with linear complexity. 108-119 - Jian Chang, Jian-Liang Wu, Yong-Ga A:
Total colorings of planar graphs with sparse triangles. 120-129
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-12-12 01:09 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:
