Log in
Sign up
Topic
▼
Journal/Conference
▼
Search
▼
|
Browse
|
Your feeds
|
Submit a paper
|
About
All of CS
·
AI
·
Data Mgmt.
·
Graphics
·
HCI
·
Networks & Comm.
·
OS
·
Parallel & Dist. Comp.
·
Prog. Languages
·
Security
·
Soft. Eng.
·
Theory & Algs.
Journal:
ArXiv: Data Structures and Algorithms
Sort:
New & recommended ·
Active
·
Top Recommended
·
New
Approximation Algorithms for Movement Repairmen. (arXiv:1306.3739v2 [cs.DS] UPDATED)
By MohammadTaghi Hajiaghayi,Rohit Khandekar,M. Reza Khani,Guy Kortsarz
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases. (arXiv:1306.2079v3 [cs.DS] UPDATED)
By Martin Fink,Sergey Pupyrev
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
A Strict Hierarchy of Dynamic Graphs for Shortest, Fastest, and Foremost Broadcast. (arXiv:1210.3277v2 [cs.DC] UPDATED)
By Arnaud Casteigts,Paola Flocchini,Bernard Mans,Nicola Santoro
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs. (arXiv:1208.3629v4 [cs.DS] UPDATED)
By Marc Lelarge,Hang Zhou
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
The General Traveling Salesman Problem, Version 3. (arXiv:1110.4052v4 [cs.DS] UPDATED)
By Howard Kleiman
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Multiarmed Bandit Problems with Delayed Feedback. (arXiv:1011.1161v3 [cs.DS] UPDATED)
By Sudipto Guha,Kamesh Munagala,Martin Pal
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Polynomial Time Algorithm for Graph Isomorphism Testing. (arXiv:1004.1808v6 [cs.DS] UPDATED)
By Michael I. Trofimov
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Sequential Design of Experiments via Linear Programming. (arXiv:0805.2630v2 [cs.DS] UPDATED)
By Sudipto Guha,Kamesh Munagala
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Succinct data structures for representing equivalence classes. (arXiv:1306.4287v1 [cs.DS])
By Moshe Lewenstein,J. Ian Munro,Venkatesh Raman
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
A bad 2-dimensional instance for k-means++. (arXiv:1306.4207v1 [cs.DS])
By Ragesh Jaiswal,Prachi Jain,Saumya Yadav
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Computation in anonymous networks. (arXiv:1306.4151v1 [cs.CC])
By Elchanan Mossel,Anupam Prakash,Gregory Valiant
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Counting thin subgraphs via packings faster than meet-in-the-middle time. (arXiv:1306.4111v1 [cs.DS])
By Andreas Björklund,Petteri Kaski,Łukasz Kowalik
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Hybrid Indexes for Repetitive Datasets. (arXiv:1306.4037v1 [cs.DS])
By H. Ferrada,T. Gagie,T. Hirvola,S. J. Puglisi
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
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
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
A Succinct Grammar Compression. (arXiv:1304.0917v3 [cs.DS] UPDATED)
By Yasuo Tabei,Yoshimasa Takabatake,Hiroshi Sakamoto
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
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
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Fast branching algorithm for Cluster Vertex Deletion. (arXiv:1306.3877v1 [cs.DS])
By Anudhyan Boral,Marek Cygan,Tomasz Kociumaka,Marcin Pilipczuk
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Computing Tree-depth Faster Than $2^{n}$. (arXiv:1306.3857v1 [cs.DS])
By Fedor V. Fomin,Archontia C. Giannopoulou,Michał Pilipczuk
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm. (arXiv:1306.3819v1 [cs.DS])
By Sebastian Wild,Markus E. Nebel,Hosam Mahmoud
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Greedy algorithms and poset matroids. (arXiv:1306.3797v1 [math.CO])
By Luca Ferrari
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Minimal Indices for Successor Search. (arXiv:1306.3772v1 [cs.DS])
By Sarel Cohen,Amos Fiat,Moshik Hershcovitch,Haim Kaplan
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Approximation Algorithms for Movement Repairmen. (arXiv:1306.3739v1 [cs.DS])
By MohammadTaghi Hajiaghayi,Rohit Khandekar,M. Reza Khani,Guy Kortsarz
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
A note on scheduling with low rank processing times. (arXiv:1306.3727v1 [cs.CC])
By Lin Chen,Deshi Ye,Guochuan Zhang
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Pattern-Based Plan Construction for the Workflow Satisfiability Problem. (arXiv:1306.3649v1 [cs.DS])
By David Cohen,Jason Crampton,Gregory Gutin,Mark Jones
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Faster Deterministic Algorithms for Packing, Matching and $t$-Dominating Set Problems. (arXiv:1306.3602v1 [cs.DS])
By Shenshi Chen,Zhixiang Chen
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Approximate Nearest Neighbor Search in $\ell_p$. (arXiv:1306.3601v1 [cs.DS])
By Huy L. Nguyen
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Faster deterministic Feedback Vertex Set. (arXiv:1306.3566v1 [cs.DS])
By Tomasz Kociumaka,Marcin Pilipczuk
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Exact and fixed-parameter algorithms for metro-line crossing minimization problems. (arXiv:1306.3538v1 [cs.DS])
By Yoshio Okamoto,Yuichi Tatsu,Yushi Uno
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
Approximation Algorithms for Bayesian Multi-Armed Bandit Problems. (arXiv:1306.3525v1 [cs.DS])
By Sudipto Guha,Kamesh Munagala
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
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
1
·
0
· from
ArXiv:cs.DS
· published 06/2013
more ->
Features coming soon:
Author profiles -- Claim your papers.
Groups -- Create a group for your department.
Paper revisions and version control.
Comments, suggestions, errors?