default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 6
Volume 6, Number 1, March 2008
- Costas S. Iliopoulos, Mirka Miller:
Special Issue of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005) September 18-21, 2005, Ballarat, Australia. 1-2 - Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang
, Yong Zhang:
On-line scheduling of parallel jobs on two machines. 3-10 - Paul D. Manuel, Mostafa I. Abd-El-Barr, Indra Rajasingh, Bharati Rajan:
An efficient representation of Benes networks and its applications. 11-19 - Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Chris Monica M.:
On minimum metric dimension of honeycomb networks. 20-27 - Jurek Czyzowicz, Wojciech Fraczak, Mohammadreza Yazdani:
Computing the throughput of Concatenation State Machines. 28-36 - Jan Holub, William F. Smyth, Shu Wang:
Fast pattern-matching on indeterminate strings. 37-50 - Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides:
Realizing partitions respecting full and partial order information. 51-58 - Kiki A. Sugeng, Mirka Miller:
On consecutive edge magic total labeling of graphs. 59-65 - Chris Charnes, Ulrich Dempwolff, Josef Pieprzyk:
The eight variable homogeneous degree three bent functions. 66-72 - Jianmin Tang, Mirka Miller, Yuqing Lin:
HSAGA and its application for the construction of near-Moore digraphs. 73-84
- Tomek Czajka, Gopal Pandurangan:
Improved random graph isomorphism. 85-92 - Marcel Wild:
Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion. 93-102 - Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson:
Approximate clustering of incomplete fingerprints. 103-108 - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta:
Radial drawings of graphs: Geometric constraints and trade-offs. 109-124 - Jens Gustedt:
Efficient sampling of random permutations. 125-139 - Maurizio Patrignani:
Complexity results for three-dimensional orthogonal graph drawing. 140-161
Volume 6, Number 2, June 2008
- Katia S. Guimarães, Marie-France Sagot:
Editorial. 163 - Claudine Chaouiya, Elisabeth Remy, Denis Thieffry:
Petri net modelling of biological regulatory networks. 165-177 - Isabelle Fagnot, Gaëlle Lelandais, Stéphane Vialette:
Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs. 178-191 - Romain Rivière, Dominique Barth, Johanne Cohen, Alain Denise:
Shuffling biological sequences with motif constraints. 192-204 - Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang:
An improved approximation algorithm for maximum edge 2-coloring in simple graphs. 205-215 - Fanica Gavril, Ron Y. Pinter, Shmuel Zaks:
Intersection representations of matrices by subtrees and unicycles on graphs. 216-228 - Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara:
Counting the number of independent sets in chordal graphs. 229-242 - Roman Kolpakov, Mathieu Raffinot:
New algorithms for text fingerprinting. 243-255 - Van Bang Le, Raffaele Mosca, Haiko Müller:
On stable cutsets in claw-free graphs and planar graphs. 256-276 - Massimiliano Caramia, Antonino Sgalambro:
On the approximation of the single source k-splittable flow problem. 277-289 - Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura:
The on-line asymmetric traveling salesman problem. 290-298 - Jérôme Monnot, Sophie Toulouse:
Approximation results for the weighted P4 partition problem. 299-312 - Vida Dujmovic, Henning Fernau, Michael Kaufmann:
Fixed parameter algorithms for one-sided crossing minimization revisited. 313-323 - Irena Rusu:
Converting suffix trees into factor/suffix oracles. 324-340 - Xujin Chen, Xiaodong Hu, Xiaohua Jia:
Inapproximability and approximability of minimal tree routing and coloring. 341-351
Volume 6, Number 3, September 2008
- Nitin, Ashok Subramanian:
Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties. 353-380 - Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann:
On minimum k-modal partitions of permutations. 381-392 - Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Red-blue covering problems and the consecutive ones property. 393-407 - Leena Salmela, Jorma Tarhio:
Fast parameterized matching with q-grams. 408-419 - Ying Kit Lai, Chung Keung Poon, Benyun Shi:
Approximate colored range and point enclosure queries. 420-432 - Ahmed Khorsi, Faissal Ouardi, Djelloul Ziadi:
Fast equation automaton computation. 433-448 - Atif Rahman, Swakkhar Shatabda, Masud Hasan:
An approximation algorithm for sorting by reversals and transpositions. 449-457 - Magnus Bordewich, Catherine McCartin, Charles Semple:
A 3-approximation algorithm for the subtree distance between phylogenies. 458-471 - Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the traffic grooming problem. 472-479 - Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson:
Approximate labelled subtree homeomorphism. 480-496 - Pierre Peterlongo, Nadia Pisanti, Frédéric Boyer, Alair Pereira do Lago, Marie-France Sagot:
Lossless filter for multiple repetitions with Hamming distance. 497-509 - Cristina Bazgan, Zsolt Tuza:
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3. 510-519 - Guy Kortsarz, Zeev Nutov:
A note on two source location problems. 520-525 - Sidi Mohamed Sedjelmaci:
A parallel extended GCD algorithm. 526-538
Volume 6, Number 4, December 2008
- Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Preface. 539 - Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston:
A bounded search tree algorithm for parameterized face cover. 541-552 - David F. Manlove, Gregg O'Malley:
Student-Project Allocation with preferences over Projects. 553-560 - Andreas Spillner:
A fixed parameter algorithm for optimal convex partitions. 561-569 - Alexander Tiskin:
Semi-local longest common subsequences in subquadratic time. 570-581 - Marc J. van Kreveld, Maarten Löffler:
Approximating largest convex hulls for imprecise points. 583-594 - Vadim V. Lozin, Martin Milanic:
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. 595-604 - Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger:
On k-connectivity problems with sharpened triangle inequality. 605-617 - Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette:
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. 618-626 - Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki:
Approximability of partitioning graphs with supply and demand. 627-650 - Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Alexander A. Shvartsman:
A robust randomized algorithm to perform independent tasks. 651-665
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 2024-11-22 19:45 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:
