science.io

Sort: New & recommended · Newly published · Newly added · Top Recommended

1

On Structural Parameterizations for the 2-Club Problem. (arXiv:1305.3735v1 [cs.CC])
By Sepp Hartung,Christian Komusiewicz,André Nichterlein,Ondrej Suchý
0 · from ArXiv:cs.DS · published 05/2013
1

The Thinnest Path Problem. (arXiv:1305.3688v1 [cs.NI])
By Jianhang Gao,Qing Zhao,Ananthram Swami
0 · from ArXiv:cs.DS · published 05/2013
1

Modeling Information Propagation with Survival Theory. (arXiv:1305.3616v1 [cs.SI])
By Manuel Gomez Rodriguez,Jure Leskovec,Bernhard Schoelkopf
0 · from ArXiv:cs.DS · published 05/2013
1

Sublinear Bounds for Randomized Leader Election. (arXiv:1210.4822v2 [cs.DS] UPDATED)
By Shay Kutten,Gopal Pandurangan,David Peleg,Peter Robinson,Amitabh Trehan
0 · from ArXiv:cs.DS · published 05/2013
1

Strongly universal string hashing is fast. (arXiv:1202.4961v3 [cs.DB] UPDATED)
By Owen Kaser,Daniel Lemire
0 · from ArXiv:cs.DS · published 05/2013
1

New Greedy Heuristics For Set Cover and Set Packing. (arXiv:1305.3584v1 [cs.DS])
By David Kordalewski
0 · from ArXiv:cs.DS · published 05/2013
1

Approximate Distance Oracle with Constant Query Time. (arXiv:1305.3314v1 [cs.DS])
By Shiri Chechik
0 · from ArXiv:cs.DS · published 05/2013
1

The Unary Fragments of Metric Interval Temporal Logic: Bounded versus Lower bound Constraints (Full Version). (arXiv:1305.3204v1 [cs.LO])
By Paritosh K. Pandya,Simoni S. Shah
0 · from ArXiv:cs.FL · published 05/2013
1

Approximation Hardness of Graphic TSP on Cubic Graphs. (arXiv:1304.6800v2 [cs.CC] UPDATED)
By Marek Karpinski,Richard Schmied
0 · from ArXiv:cs.DS · published 05/2013
1

Spaces, Trees and Colors: The Algorithmic Landscape of Document Retrieval on Sequences. (arXiv:1304.6023v3 [cs.DS] UPDATED)
By Gonzalo Navarro
0 · from ArXiv:cs.DS · published 05/2013
1

Concur : An Algorithm for Merging Concurrent Changes without Conflicts. (arXiv:1303.7462v2 [cs.DS] UPDATED)
By James Smith
0 · from ArXiv:cs.DS · published 05/2013
1

Interval Deletion is Fixed-Parameter Tractable. (arXiv:1211.5933v2 [cs.DS] UPDATED)
By Yixin Cao,Dániel Marx
0 · from ArXiv:cs.DS · published 05/2013
1

Constrained Multilinear Detection and Generalized Graph Motifs. (arXiv:1209.1082v3 [cs.DS] UPDATED)
By Andreas Bjorklund,Petteri Kaski,Lukasz Kowalik
0 · from ArXiv:cs.DS · published 05/2013
1

Efficient Density Estimation via Piecewise Polynomial Approximation. (arXiv:1305.3207v1 [cs.LG])
By Siu-On Chan,Ilias Diakonikolas,Rocco A. Servedio,Xiaorui Sun
0 · from ArXiv:cs.DS · published 05/2013
1

Heaviest Induced Ancestors and Longest Common Substrings. (arXiv:1305.3164v1 [cs.DS])
By Travis Gagie,Paweł Gawrychowski,Yakov Nekrich
0 · from ArXiv:cs.DS · published 05/2013
1

FPT is Characterized by Useful Obstruction Sets. (arXiv:1305.3102v1 [cs.CC])
By Michael R. Fellows,Bart M. P. Jansen
0 · from ArXiv:cs.DS · published 05/2013
1

LabelRank: A Stabilized Label Propagation Algorithm for Community Detection in Networks. (arXiv:1303.0868v2 [cs.SI] CROSS LISTED)
By Jierui Xie,Boleslaw K. Szymanski
0 · from ArXiv:cs.DS · published 05/2013
1

A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs. (arXiv:1304.1810v2 [cs.DS] UPDATED)
By Jeff Erickson,Anastasios Sidiropoulos
0 · from ArXiv:cs.DS · published 05/2013
1

Adaptive Metric Dimensionality Reduction. (arXiv:1302.2752v2 [cs.LG] UPDATED)
By Lee-Ad Gottlieb,Aryeh Kontorovich,Robert Krauthgamer
0 · from ArXiv:cs.DS · published 05/2013
1

Choose Outsiders First: a mean 2-approximation random algorithm for covering problems. (arXiv:1208.5907v2 [cs.DS] UPDATED)
By Etienne Birmelé
0 · from ArXiv:cs.DS · published 05/2013
1

Dictionary learning under global sparsity constraint. (arXiv:1202.6562v2 [cs.DS] UPDATED)
By Deyu Meng,Yee Leung,Qian Zhao,Zongben Xu
0 · from ArXiv:cs.DS · published 05/2013
1

Dynamic Top-$k$ Dominating Queries. (arXiv:1305.2835v1 [cs.CG])
By Andreas Kosmatopoulos,Kostas Tsichlas
0 · from ArXiv:cs.DS · published 05/2013
1

Fingerprints in Compressed Strings. (arXiv:1305.2777v1 [cs.DS])
By Philip Bille,Patrick Hagge Cording,Inge Li Gørtz,Benjamin Sach,Hjalte Wedel Vildhøj,Søren Vind
0 · from ArXiv:cs.DS · published 05/2013
1

OBDD-Based Representation of Interval Graphs. (arXiv:1305.2772v1 [cs.DS])
By Marc Gillé
0 · from ArXiv:cs.DS · published 05/2013
1

A faster FPT algorithm for Bipartite Contraction. (arXiv:1305.2743v1 [cs.DS])
By Sylvain Guillemot,Dániel Marx
0 · from ArXiv:cs.DS · published 05/2013
1

Fibonacci Graphs and their Expressions. (arXiv:1305.2647v1 [cs.DS])
By Mark Korenblit,Vadim E. Levit
0 · from ArXiv:cs.DS · published 05/2013
1

On the Optimal Representation of Algebraic Expressions of Fibonacci Graphs. (arXiv:1305.2645v1 [cs.DS])
By Mark Korenblit,Vadim E. Levit
0 · from ArXiv:cs.DS · published 05/2013
1

Full Square Rhomboids and Their Algebraic Expressions. (arXiv:1305.2636v1 [cs.DS])
By Mark Korenblit
0 · from ArXiv:cs.DS · published 05/2013
1

Bandits with Knapsacks. (arXiv:1305.2545v1 [cs.DS])
By Ashwinkumar Badanidiyuru,Robert Kleinberg,Aleksandrs Slivkins
0 · from ArXiv:cs.DS · published 05/2013
1

Finding Distinct Subpalindromes Online. (arXiv:1305.2540v1 [cs.DS])
By Dmitry Kosolobov,Mikhail Rubinchik,Arseny M. Shur
0 · from ArXiv:cs.DS · published 05/2013

more ->