default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 14
Volume 14, July 2012
- Costas S. Iliopoulos, William F. Smyth:
Editorial. 1 - Desh Ranjan, John E. Savage, Mohammad Zubair:
Upper and lower I/O bounds for pebbling r-pyramids. 2-12 - Prosenjit Bose
, Karim Douïeb, Pat Morin:
Skip lift: A probabilistic alternative to red-black trees. 13-20 - Tugkan Batu, Petra Berenbrink, Colin Cooper:
Chains-into-bins processes. 21-28 - Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the maximal sum of exponents of runs in a string. 29-36 - Ferdinando Cicalese, Péter L. Erdös, Zsuzsanna Lipták:
A linear algorithm for string reconstruction in the reverse complement equivalence model. 37-54 - Francine Blanchet-Sadri, Bob Chen, Aleksandar Chakarov:
Number of holes in unavoidable sets of partial words I. 55-64 - Francine Blanchet-Sadri, Steven Ji, Elizabeth Reiland:
Number of holes in unavoidable sets of partial words II. 65-73 - Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo:
Dictionary-symbolwise flexible parsing. 74-90 - Djamal Belazzougui:
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model. 91-106 - Julien Allali, Cédric Chauve, Pascal Ferraro, Anne-Laure Gaillard:
Efficient chaining of seeds in ordered trees. 107-118 - Yusaku Kaneta, Hiroki Arimura, Rajeev Raman:
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism. 119-135 - Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin:
The complexity of finding uniform sparsest cuts in various graph classes. 136-149 - Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. 150-172 - Pinar Heggernes, Pim van 't Hof, Daniël Paulusma:
Computing role assignments of proper interval graphs in polynomial time. 173-188 - Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs. 189-206 - Konrad K. Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach:
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. 207-213 - Mathias Hauptmann, Richard Schmied, Claus Viehmann:
Approximation complexity of Metric Dimension problem. 214-222 - Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik:
Testing connectivity of faulty networks in sublinear time. 223-231 - Alfredo Navarra, Maria Cristina Pinotti, Andrea Formisano:
Distributed colorings for collision-free routing in sink-centric sensor networks. 232-247 - Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry:
Path-based supports for hypergraphs. 248-261
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-02 23:29 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:
