science.io

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

1

Approximation Algorithms for Bayesian Multi-Armed Bandit Problems. (arXiv:1306.3525v1 [cs.DS])
By Sudipto Guha,Kamesh Munagala
0 · from ArXiv:cs.DS · published 06/2013
1

Exact and fixed-parameter algorithms for metro-line crossing minimization problems. (arXiv:1306.3538v1 [cs.DS])
By Yoshio Okamoto,Yuichi Tatsu,Yushi Uno
0 · from ArXiv:cs.DS · published 06/2013
1

Faster deterministic Feedback Vertex Set. (arXiv:1306.3566v1 [cs.DS])
By Tomasz Kociumaka,Marcin Pilipczuk
0 · from ArXiv:cs.DS · published 06/2013
1

Approximate Nearest Neighbor Search in $\ell_p$. (arXiv:1306.3601v1 [cs.DS])
By Huy L. Nguyen
0 · from ArXiv:cs.DS · published 06/2013
1

Faster Deterministic Algorithms for Packing, Matching and $t$-Dominating Set Problems. (arXiv:1306.3602v1 [cs.DS])
By Shenshi Chen,Zhixiang Chen
0 · from ArXiv:cs.DS · published 06/2013
1

Pattern-Based Plan Construction for the Workflow Satisfiability Problem. (arXiv:1306.3649v1 [cs.DS])
By David Cohen,Jason Crampton,Gregory Gutin,Mark Jones
0 · from ArXiv:cs.DS · published 06/2013
1

A note on scheduling with low rank processing times. (arXiv:1306.3727v1 [cs.CC])
By Lin Chen,Deshi Ye,Guochuan Zhang
0 · from ArXiv:cs.DS · published 06/2013
1

Approximation Algorithms for Movement Repairmen. (arXiv:1306.3739v1 [cs.DS])
By MohammadTaghi Hajiaghayi,Rohit Khandekar,M. Reza Khani,Guy Kortsarz
0 · from ArXiv:cs.DS · published 06/2013
1

Minimal Indices for Successor Search. (arXiv:1306.3772v1 [cs.DS])
By Sarel Cohen,Amos Fiat,Moshik Hershcovitch,Haim Kaplan
0 · from ArXiv:cs.DS · published 06/2013
1

Greedy algorithms and poset matroids. (arXiv:1306.3797v1 [math.CO])
By Luca Ferrari
0 · from ArXiv:cs.DS · published 06/2013
1

Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm. (arXiv:1306.3819v1 [cs.DS])
By Sebastian Wild,Markus E. Nebel,Hosam Mahmoud
0 · from ArXiv:cs.DS · published 06/2013
1

Computing Tree-depth Faster Than $2^{n}$. (arXiv:1306.3857v1 [cs.DS])
By Fedor V. Fomin,Archontia C. Giannopoulou,Michał Pilipczuk
0 · from ArXiv:cs.DS · published 06/2013
1

Fast branching algorithm for Cluster Vertex Deletion. (arXiv:1306.3877v1 [cs.DS])
By Anudhyan Boral,Marek Cygan,Tomasz Kociumaka,Marcin Pilipczuk
0 · from ArXiv:cs.DS · published 06/2013
1

Probe Scheduling for Efficient Detection of Silent Failures. (arXiv:1302.0792v2 [cs.NI] UPDATED)
By Edith Cohen,Avinatan Hassidim,Haim Kaplan,Yishay Mansour,Danny Raz,Yoav Tzur
0 · from ArXiv:cs.DS · published 06/2013
1

A Succinct Grammar Compression. (arXiv:1304.0917v3 [cs.DS] UPDATED)
By Yasuo Tabei,Yoshimasa Takabatake,Hiroshi Sakamoto
0 · from ArXiv:cs.DS · published 06/2013
1

MinMax-Profiles: A Unifying View of Common Intervals, Nested Common Intervals and Conserved Intervals of K Permutations. (arXiv:1304.5140v2 [cs.DS] UPDATED)
By Irena Rusu
0 · from ArXiv:cs.DS · published 06/2013
1

Extended to Multi-Tilde-Bar Regular Expressions and Efficient Finite Automata Constructions. (arXiv:1306.3507v1 [cs.FL])
By Jean-Marc Champarnaud,Faissal Ouardi,Djelloul Ziadi
0 · from ArXiv:cs.FL · published 06/2013
1

Automatic functions, linear time and learning. (arXiv:1306.3726v1 [cs.FL])
By John Case,Sanjay Jain,Samuel Seah,Frank Stephan
0 · from ArXiv:cs.FL · published 06/2013
1

Block Maps between Primitive Uniform and Pisot Substitutions. (arXiv:1306.3777v1 [math.DS])
By Ville Salo,Ilkka Törmä
0 · from ArXiv:cs.FL · published 06/2013
1

Scalable Neighborhood Sketching and Distance Distribution Estimation in Graph Datasets: Revisited, Unified, and Improved. (arXiv:1306.3284v1 [cs.DS])
By Edith Cohen
0 · from ArXiv:cs.DS · published 06/2013
1

Set-Difference Range Queries. (arXiv:1306.3482v1 [cs.DS])
By David Eppstein,Michael T. Goodrich,Joseph A. Simons
0 · from ArXiv:cs.DS · published 06/2013
1

Schulze and Ranked-Pairs Voting are Fixed-Parameter Tractable to Bribe, Manipulate, and Control. (arXiv:1210.6963v3 [cs.GT] UPDATED)
By Lane A. Hemaspaandra,Rahman Lavaee,Curtis Menton
0 · from ArXiv:cs.DS · published 06/2013
1

Semilinearity and Context-Freeness of Languages Accepted by Valence Automata. (arXiv:1306.3260v1 [cs.FL])
By P. Buckheister,Georg Zetzsche
0 · from ArXiv:cs.FL · published 06/2013
1

Syntactic Complexity of Circular Semi-Flower Automata. (arXiv:1306.3492v1 [cs.FL])
By Shubh Narayan Singh,K. V. Krishna
0 · from ArXiv:cs.FL · published 06/2013
1

Graphs with Plane Outside-Obstacle Representations. (arXiv:1306.2978v1 [cs.CG])
By Alexander Koch,Marcus Krug,Ignaz Rutter
0 · from ArXiv:cs.DS · published 06/2013
1

Matching with our Eyes Closed. (arXiv:1306.2988v1 [cs.DS])
By Gagan Goel,Pushkar Tripathi
0 · from ArXiv:cs.DS · published 06/2013
1

Cole's Parametric Search Technique Made Practical. (arXiv:1306.3000v1 [cs.DS])
By Michael T. Goodrich,Paweł Pszona
0 · from ArXiv:cs.DS · published 06/2013
1

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. (arXiv:1306.3030v1 [cs.DS])
By Karl Bringmann,Christian Engels,Bodo Manthey,B.V. Raghavendra Rao
0 · from ArXiv:cs.DS · published 06/2013
1

Uncapacitated Flow-based Extended Formulations. (arXiv:1306.3119v1 [math.OC])
By Samuel Fiorini,Kanstantsin Pashkovich
0 · from ArXiv:cs.DS · published 06/2013
1

An Efficient Branching Algorithm for Interval Completion. (arXiv:1306.3181v1 [cs.DS])
By Yixin Cao
0 · from ArXiv:cs.DS · published 06/2013

more ->