# Algorithmics

## Papers overview

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

Highly Cited

2013

Highly Cited

2013

- Series on Theoretical Computer Science
- 2013

• Page 17, line 13: “constrast” −→ “contrast”. (Due to Mechthild Opperud.) • Page 21, line 17: “attributes” −→ “attributed… (More)

Is this relevant?

2012

2012

- MFCS
- 2012

Once having classified an NP-hard problem fixed-parameter tractable with respect to a certain parameter, the race for the most… (More)

Is this relevant?

2011

2011

- IEEE 52nd Annual Symposium on Foundations of…
- 2011

The converging trends of society's desire/need for more sustainable technologies, exponentially increasing power densities within… (More)

Is this relevant?

2011

2011

- 2011

Preface This thesis summarizes some of my results on NP-hard graph problems that have applications in the areas of network… (More)

Is this relevant?

2007

2007

- Commun. ACM
- 2007

Theoretical questions and motivations, combined with empirical research methods, produce insights into algorithm and program… (More)

Is this relevant?

2005

2005

- STACS
- 2005

Exponential algorithms, i.e. algorithms of complexity O(c) for some c > 1, seem to be unavoidable in the case of NP-complete… (More)

Is this relevant?

2004

2004

- 2004

Some people may be laughing when looking at you reading in your spare time. Some may be admired of you. And some may want be like… (More)

Is this relevant?

Review

2002

Review

2002

- PODS
- 2002

Modern search engines answer keyword-based queries extremely efficiently. The impressive speed is due to clever inverted index… (More)

Is this relevant?

2002

2002

- 2002

Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or… (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- 1992

LAW and ORDER in ALGORITHMICS An algorithm is the input-output effect of a computer program; mathematically, the notion of… (More)

Is this relevant?