default search action
IWOCA 2014: Duluth, MN, USA
- Jan Kratochvíl, Mirka Miller, Dalibor Froncek:
Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8986, Springer 2015, ISBN 978-3-319-19314-4 - Faisal N. Abu-Khzam, Edouard Bonnet, Florian Sikora:
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism. 1-12 - Anna Adamaszek
, Guillaume Blin
Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem. 13-23 - Mousa Alfalayleh, Ljiljana Brankovic
Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk. 24-36 - Nicola Apollonio, Massimiliano Caramia
On the Galois Lattice of Bipartite Distance Hereditary Graphs. 37-48 - Carl Barton, Costas S. Iliopoulos, Solon P. Pissis
Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance. 49-61 - Francine Blanchet-Sadri, Michelle Cordier
Border Correlations, Lattices, and the Subgraph Component Polynomial. 62-73 - Francine Blanchet-Sadri, Andrew Lohr:
Computing Minimum Length Representations of Sets of Words of Uniform Length. 74-85 - Francine Blanchet-Sadri, Jordan Nikkel, J. D. Quigley, Xufan Zhang:
Computing Primitively-Rooted Squares and Runs in Partial Words. 86-97 - Ilkyoo Choi
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle. 98-109 - Fan Chung, Olivia Simpson:
Computing Heat Kernel Pagerank and a Local Clustering Algorithm. 110-121 - Sylwia Cichacz
A \varGamma -magic Rectangle Set and Group Distance Magic Labeling. 122-127 - Selma Djelloul:
Solving Matching Problems Efficiently in Bipartite Graphs. 128-139 - Stephane Durocher, Saeed Mehrabi:
A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras. 140-152 - Saad I. El-Zanati, Uthoomporn Jongthawonwuth, Heather Jordon, Charles Vanden Eynden:
On Decomposing the Complete Graph into the Union of Two Disjoint Cycles. 153-163 - Takehiro Ito, Hiroyuki Nooka, Xiao Zhou:
Reconfiguration of Vertex Covers in a Graph. 164-175 - Varunkumar Jayapaul
Space Efficient Data Structures for Nearest Larger Neighbor. 176-187 - Gerold Jäger, Marcin Peczarski:
Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory. 188-199 - Nils M. Kriege, Florian Kurpicz
On Maximum Common Subgraph Problems in Series-Parallel Graphs. 200-212 - Augustine Kwanashie, Robert W. Irving, David F. Manlove
Profile-Based Optimal Matchings in the Student/Project Allocation Problem. 213-225 - Tommi Larjomaa, Alexandru Popa
The Min-max Edge q-Coloring Problem. 226-237 - Nathan Lindzey:
Speeding up Graph Algorithms via Switching Classes. 238-249 - Daniel Collister, Daphne Der-Fen Liu:
Study of \kappa (D) for D = 2, 3, x, y. 250-261 - Christian Laforest, Benjamin Momège:
Some Hamiltonian Properties of One-Conflict Graphs. 262-273 - Patrick C. Murray, Charles J. Colbourn:
Sequence Covering Arrays and Linear Extensions. 274-285 - Leonidas Palios, Petros Tzimas:
Minimum r-Star Cover of Class-3 Orthogonal Polygons. 286-297 - R. Sundara Rajan
Embedding Circulant Networks into Butterfly and Benes Networks. 298-306 - Zahed Rahmati
Kinetic Reverse k-Nearest Neighbor Problem. 307-317 - Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot:
Efficiently Listing Bounded Length st-Paths. 318-329 - Rinovia Simanjuntak
Metric Dimension for Amalgamations of Graphs. 330-337 - Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
A Suffix Tree Or Not a Suffix Tree? 338-350 - Yuma Tamura, Takehiro Ito, Xiao Zhou:
Deterministic Algorithms for the Independent Feedback Vertex Set Problem. 351-363 - Christophe Vroland, Mikaël Salson, Hélène Touzet:
Lossless Seeds for Searching Short Patterns with High Error Rates. 364-375
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-12-16 22:14 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: