Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

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

2017

2017

We study the problem of computing constrained shortest paths for battery electric vehicles. Since battery capacities are limited… Expand

Is this relevant?

Highly Cited

2016

Highly Cited

2016

The amount of graph-structured data has recently experienced an enormous growth in many applications. To transform such data into… Expand

Is this relevant?

Highly Cited

2016

Highly Cited

2016

Robust optimization is a young and emerging field of research having received a considerable increase of interest over the last… Expand

Is this relevant?

2014

2014

Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on… Expand

Is this relevant?

2012

2012

Motivated by problems in comparative genomics and paleogenomics, we study the computational complexity of the Gapped Consecutive… Expand

Is this relevant?

2010

2010

1. Foundations of Algorithm Engineering.- 2. Modeling.- 3. Selected Design Issues.- 4. Analysis of Algorithms.- 5. Realistic… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

Abstract
Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems… Expand

Is this relevant?

2002

2002

Leading algorithms for Boolean satisfiability (SAT) are based on either a depth-first tree traversal of the search space (the DLL… Expand

Is this relevant?

Highly Cited

1995

Highly Cited

1995

In this lesson plan, which can be delivered as a 45-minute lesson or as shorter segments over three lessons, learners will be… Expand

Is this relevant?

1992

1992

1 Prerequisites.- 7.1 Sets and Relations.- 10.2 Linear Algebra.- 14.3 Topology.- 15.4 Polyhedra.- 2 Linear Duality in Graphs.- 2… Expand

Is this relevant?