| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
Maximal strip recovery problem with gaps: Hardness and approximation algorithms.  |
J. Discrete Algorithms  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiangzhi Wei, Ajay Joneja |
An improved algorithm for the shortest descending path on a convex terrain. |
J. Discrete Algorithms |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
Fast q-gram mining on SLP compressed strings. |
J. Discrete Algorithms |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Pedram Ghodsnia, Kamran Tirdad, J. Ian Munro, Alejandro López-Ortiz |
A novel approach for leveraging co-occurrence to improve the false positive error in signature files. |
J. Discrete Algorithms |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Giuseppe F. Italiano |
Near real-time suffix tree construction via the fringe marked ancestor problem. |
J. Discrete Algorithms |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Djamal Belazzougui, Mathieu Raffinot |
Approximate regular expression matching with multi-strings. |
J. Discrete Algorithms |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Takuro Fukunaga |
Approximating minimum cost source location problems with local vertex-connectivity demands. |
J. Discrete Algorithms |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Thachuk |
Indexing hypertext. |
J. Discrete Algorithms |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Nedialko B. Dimitrov, C. Greg Plaxton |
Optimal cover time for a graph-based coupon collector process. |
J. Discrete Algorithms |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Shirou Maruyama, Masaya Nakahara, Naoya Kishiue, Hiroshi Sakamoto |
ESP-index: A compressed index based on edit-sensitive parsing. |
J. Discrete Algorithms |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Wing-Kai Hon, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter |
Compressed text indexing with wildcards. |
J. Discrete Algorithms |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Djamal Belazzougui, Gonzalo Navarro, Daniel Valenzuela |
Improved compressed indexes for full-text document retrieval. |
J. Discrete Algorithms |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Veronica Gil Costa, Rodrygo L. T. Santos, Craig Macdonald, Iadh Ounis |
Modelling efficient novelty-based search result diversification in metric spaces. |
J. Discrete Algorithms |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Georges Dupret, Benjamin Piwowarski |
Model Based Comparison of Discounted Cumulative Gain and Average Precision. |
J. Discrete Algorithms |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Fabrizio Sebastiani, Fabrizio Silvestri |
Editorial. |
J. Discrete Algorithms |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger |
Computing the longest common prefix array based on the Burrows-Wheeler transform. |
J. Discrete Algorithms |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Rui Mao, Willard L. Miranker, Daniel P. Miranker |
Pivot selection: Dimension reduction for distance-based indexing. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Haim Parienty |
Towards a theory of patches. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Francine Blanchet-Sadri, Travis Mandel, Gautam Sisodia |
Periods in partial words: An algorithm. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi |
On bounded degree plane strong geometric spanners. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakub Radoszewski, Wojciech Rytter |
On the structure of compacted subword graphs of Thue-Morse words and their applications. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Domenico Cantone, Simone Faro, Emanuele Giaquinta |
On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Karim Douïeb, Pat Morin |
Skip lift: A probabilistic alternative to red-black trees. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry |
Path-based supports for hypergraphs. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Senjuti Basu Roy, Gautam Das, Sajal K. Das |
Algorithms for computing Best Coverage Path in the presence of obstacles in a sensor field. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alfredo Navarra, Maria Cristina Pinotti, Andrea Formisano |
Distributed colorings for collision-free routing in sink-centric sensor networks. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, John Howat, Pat Morin |
A distribution-sensitive dictionary with low space overhead. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, Md. Saidur Rahman 0001 |
Acyclic colorings of graph subdivisions revisited. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Radzik, German Tischler |
Editorial. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul S. Haynes, Lyuba Alboul, Jacques Penders |
Dynamic graph-based search in unknown environments. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tugkan Batu, Petra Berenbrink, Colin Cooper |
Chains-into-bins processes. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Beal, Donald A. Adjeroh |
p-Suffix sorting as arithmetic coding. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiri Novák, Tomás Skopal, David Hoksza, Jakub Lokoc |
Non-metric similarity search of tandem mass spectra including posttranslational modifications. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa |
Improved approximation bounds for the Student-Project Allocation problem with preferences over projects. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hadas Shachnai, Tami Tamir |
Approximation schemes for generalized two-dimensional vector packing with application to data placement. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Baker, Antoine Deza, Frantisek Franek |
On the structure of run-maximal strings. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zahed Rahmati, Alireza Zarei |
Kinetic Euclidean minimum spanning tree in the plane. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tanaeem M. Moosa, M. Sohel Rahman |
Sub-quadratic time and linear space data structures for permutation matching in binary strings. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Bonsma |
Max-leaves spanning tree is APX-hard for cubic graphs. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik |
Testing connectivity of faulty networks in sublinear time. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Binkele-Raible, Henning Fernau |
An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Manish Patil, Rahul Shah, Sharma V. Thankachan |
Succinct representations of weighted trees supporting path queries. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Khalegh Mamakani, Wendy J. Myrvold, Frank Ruskey |
Generating simple convex Venn diagrams. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sounaka Mishra |
Complexity of majority monopoly and signed domination problems. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Julien Allali, Cedric Chauve, Pascal Ferraro, Anne-Laure Gaillard |
Efficient chaining of seeds in ordered trees. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Beal, Donald A. Adjeroh |
Variations of the parameterized longest previous factor. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller |
A new view on Rural Postman based on Eulerian Extension and Matching. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Mouchard, Simon J. Puglisi |
Editorial. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo |
An algorithm for finding input-output constrained convex sets in an acyclic digraph. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Senft, Tomás Dvorák |
On-line suffix tree construction with reduced branching. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yusaku Kaneta, Hiroki Arimura, Rajeev Raman |
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Frantisek Franek, Robert C. G. Fuller, Jamie Simpson, William F. Smyth |
More results on overlapping squares. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacqueline W. Daykin, Bill Smyth, Lynette van Zijl |
Editorial. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dirk Sudholt, Christian Thyssen |
Running time analysis of Ant Colony Optimization for shortest path problems. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma |
On the parameterized complexity of coloring graphs in the absence of a linear forest. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Júlio Araujo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski |
Weighted improper colouring. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martine Léonard, Laurent Mouchard, Mikaël Salson |
On the number of elements to reorder when updating a suffix array. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann |
Approximating vertex cover in dense hypergraphs. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Evguenia Kopylova, William F. Smyth |
The three squares lemma revisited. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach |
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, Derrick G. Kourie, Laurent Mouchard, Themba K. Musombuka, Solon P. Pissis, Corné de Ridder |
An algorithm for mapping short reads to a dynamically changing genomic sequence. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken Habgood, Itamar Arel |
A condensation-based application of Cramer's rule for solving large-scale linear systems. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Chimani, Petra Mutzel, Bernd Zey |
Improved Steiner tree algorithms for bounded treewidth. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Marcin Kaminski, Daniël Paulusma |
Detecting induced star-like minors in polynomial time. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dror Rawitz, Shimon Shahar |
Capacitated Arc Stabbing. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Schaudt |
Efficient total domination in digraphs. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic |
Detecting 2-joins faster. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Francisco Claude, Gonzalo Navarro, Hannu Peltola, Leena Salmela, Jorma Tarhio |
String matching with alphabet sampling. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Muhammad Rashed Alam, M. Sohel Rahman |
The substring inclusion constraint longest common subsequence problem can be solved in quadratic time. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong |
The knapsack problem with neighbour constraints. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin |
The complexity of finding uniform sparsest cuts in various graph classes. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Pestov |
Indexability, concentration, and VC theory. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Francine Blanchet-Sadri, Bob Chen, Aleksandar Chakarov |
Number of holes in unavoidable sets of partial words I. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter |
On position restricted substring searching in succinct space. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | A. N. Trahtman |
An algorithm for road coloring. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Walicki, Sjur Dyrkolbotn |
Finding kernels or solving SAT. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Benkert, Joachim Gudmundsson, Damian Merrick, Thomas Wolle |
Approximate one-to-one point pattern matching. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Ciaccia, Marco Patella |
Editorial. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo |
Dictionary-symbolwise flexible parsing. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Schaudt |
On weighted efficient total domination. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen |
Steiner tree reoptimization in graphs with sharpened triangle inequality. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, William F. Smyth |
Editorial. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Ignasi Sau, Saket Saurabh |
Parameterized complexity of finding small degree-constrained subgraphs. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Daniël Paulusma |
Computing role assignments of proper interval graphs in polynomial time. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mathias Hauptmann, Richard Schmied, Claus Viehmann |
Approximation complexity of Metric Dimension problem. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Francine Blanchet-Sadri, Steven Ji, Elizabeth Reiland |
Number of holes in unavoidable sets of partial words II. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | David Gamarnik, Dmitriy Katz |
Correlation decay and deterministic FPTAS for counting colorings of a graph. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis |
Tree template matching in ranked ordered trees by pushdown automata. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
On the maximal sum of exponents of runs in a string. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Condon, Chris Thachuk |
Efficient codon optimization with motif engineering. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Bernard Ries, Dominique de Werra |
d-Transversals of stable sets and vertex covers in weighted bipartite graphs. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafael Carrascosa, François Coste, Matthias Gallé, Gabriel G. Infante López |
Searching for smallest grammars on large sequences and application to DNA. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz |
Indeterminate string inference algorithms. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Prasad Chebolu, Mary Cryan, Russell Martin |
Exact counting of Euler tours for generalized series-parallel graphs. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Amr Elmasry, Arash Farzan, John Iacono |
A priority queue with the time-finger property. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis |
On left and right seeds of a string. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Knauer, Lena Schlipf, Jens M. Schmidt, Hans Raj Tiwary |
Largest inscribed rectangles in convex polygons. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk |
Strengthening hash families and compressive sensing. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")