# Symposium on Discrete Algorithms

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- SODA
- 2015

We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in aâ€¦Â (More)

Is this relevant?

2014

2014

- 2014

Digital collections of data continue to grow exponentially as the information age continues to infiltrate every aspect of societyâ€¦Â (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- 2012

Geometric Approximation Algorithms: A Summary Based Approach by Sharathkumar Raghvendra Department of Computer Science, Dukeâ€¦Â (More)

Is this relevant?

2010

2010

- SIAM J. Comput.
- 2010

We show that any deterministic streaming algorithm that makes a constant number of passes over the input and gives a constantâ€¦Â (More)

Is this relevant?

2010

2010

- Discrete Mathematics & Theoretical Computerâ€¦
- 2010

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether theyâ€¦Â (More)

Is this relevant?

2009

2009

- TAMC
- 2009

We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain aâ€¦Â (More)

Is this relevant?

2006

2006

- SWAT
- 2006

We give a linear time recognition algorithm for circular-arc graphs. Our algorithm is much simpler than the linear timeâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- MobiCom
- 2003

This paper considers the problem of determining the achievable rates in multi-hop wireless networks. We consider the problem ofâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- SODA
- 2001

We study approximation algorithms for placing replicated data in arbitrary networks. Consider a network of nodes with individualâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Networks
- 1998

Abstract: In this paper, we present the implementation of a branch-and-cut algorithm for solving Steiner tree problems in graphsâ€¦Â (More)

Is this relevant?