default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 7
Volume 7, Number 1, March 2009
- Edgar Chávez
, Gonzalo Navarro:
Editorial. 1-2 - Veronica Gil-Costa, Mauricio Marín, Nora Reyes:
Parallel query processing on distributed clustering indexes. 3-17 - Rodrigo Paredes, Nora Reyes:
Solving similarity joins and range queries in metric spaces with the list of twin clusters. 18-35 - Marco Patella, Paolo Ciaccia:
Approximate similarity search: A multi-faceted problem. 36-48 - Matthew Skala:
Counting distance permutations. 49-61 - Tomás Skopal, Jakub Lokoc:
New dynamic construction techniques for M-tree. 62-77
- Aïda Ouangraoua, Pascal Ferraro:
A new constrained edit distance between quotiented ordered trees. 78-89 - Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
Finding occurrences of protein complexes in protein-protein interaction graphs. 90-101 - Cédric Bentz, Marie-Christine Costa, Nicolas Derhy, Frédéric Roupin:
Cardinality constrained and multicriteria (multi)cut problems. 102-111 - Adrian Dumitrescu, Csaba D. Tóth:
Light orthogonal networks with constant geometric dilation. 112-129 - Yung H. Tsin:
Yet another optimal algorithm for 3-edge-connectivity. 130-146
Volume 7, Number 2, June 2009
- Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Editorial. 147 - Henning Fernau, David F. Manlove:
Vertex and edge covers with clustering properties: Complexity and algorithms. 149-167 - Páidí J. Creed:
Sampling Eulerian orientations of triangular lattice graphs. 168-180 - Hannes Moser, Dimitrios M. Thilikos:
Parameterized complexity of finding regular induced subgraphs. 181-190 - Igor Razgon:
Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3. 191-212 - Robert W. Irving, David F. Manlove, Gregg O'Malley:
Stable marriage with ties and bounded length preference lists. 213-219 - Taoyang Wu, Peter J. Cameron, Søren Riis:
On the guessing number of shift graphs. 220-226
- Alberto Apostolico, Giorgio Satta:
Discovering subword associations in strings in time linear in the output size. 227-238 - Rossen Atanassov, Prosenjit Bose, Mathieu Couture, Anil Maheshwari, Pat Morin, Michel Paquette, Michiel H. M. Smid, Stefanie Wuhrer:
Algorithms for optimal outlier removal. 239-248 - Raja Jothi, Balaji Raghavachari:
Improved approximation algorithms for the single-sink buy-at-bulk network design problems. 249-255 - Joachim Spoerhase, Hans-Christoph Wirth:
Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree. 256-266 - Kunsoo Park, Heejin Park, Woo-Chul Jeun, Soonhoi Ha:
Boolean circuit programming: A new paradigm to design parallel algorithms. 267-277
Volume 7, Number 3, September 2009
- Giuseppe F. Italiano, Rossella Petreschi:
Preface. 279 - Yvonne Bleischwitz, Burkhard Monien:
Fair cost-sharing methods for scheduling jobs on parallel machines. 280-290 - Miroslav Chlebík, Janka Chlebíková:
Hardness of approximation for orthogonal rectangle packing and covering problems. 291-305 - Philip Bille, Inge Li Gørtz:
Matching subsequences in trees. 306-314 - Ming-Yang Kao, Manan Sanghi:
An approximation algorithm for a bottleneck traveling salesman problem. 315-326 - Annamária Kovács:
Tighter approximation bounds for LPT scheduling in two special cases. 327-340 - Erez Kantor, David Peleg:
Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems. 341-362
Volume 7, Number 4, December 2009
- Mustaq Ahmed:
Ordered interval routing schemes. 363-376 - Sven Peyer, Dieter Rautenbach, Jens Vygen:
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing. 377-390 - Peter Damaschke, Leonid Molokov:
The union of minimal hitting sets: Parameterized combinatorial bounds and counting. 391-401 - Uwe Naumann:
DAG reversal is NP-complete. 402-410 - Judit Nagy-György:
Randomized algorithm for the k-server problem on decomposable spaces. 411-419 - Ei Ando, Toshio Nakata, Masafumi Yamashita:
Approximating the longest path length of a stochastic DAG by a normal distribution in linear time. 420-438 - Olca A. Çakiroglu, Cesim Erten, Ömer Karatas, Melih Sözdinler:
Crossing minimization in weighted bipartite graphs. 439-452 - Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of minimum and maximum traveling salesman's tours. 453-463 - Andrzej Lingas, Martin Wahlen:
An exact algorithm for subgraph homeomorphism. 464-468 - Magdalene G. Borgelt, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Damian Merrick, Rodrigo I. Silveira, Mostafa Vahedi:
Planar bichromatic minimum spanning trees. 469-478 - Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati:
How to draw a clustered tree. 479-499 - Grzegorz Herman, Michael Soltys:
On the Ehrenfeucht-Mycielski sequence. 500-508 - Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo:
Algorithms for generating convex sets in acyclic digraphs. 509-518 - Yong Gao:
Threshold dominating cliques in random graphs and interval routing. 519-532 - Pinar Heggernes, Dieter Kratsch, Daniel Meister:
Bandwidth of bipartite permutation graphs in polynomial time. 533-544 - Marcin Bienkowski, Jaroslaw Byrka, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide:
Optimal algorithms for page migration in dynamic networks. 545-569 - Toshimasa Ishii:
Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs. 570-578 - Kimmo Fredriksson, Szymon Grabowski:
Average-optimal string matching. 579-594
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-10-22 02:18 CEST 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:
