Result 1 to 20 of 517 total
Simple wriggling is hard unless you are a fat hippo. (English)
Theory Comput. Syst. 50, No. 1, 93-110 (2012).
1
Solving shortest path problems with a weight constraint and replenishment arcs. (English)
Comput. Oper. Res. 39, No. 5, 964-984 (2012).
2
Finding the $K$ shortest paths in a schedule-based transit network. (English)
Comput. Oper. Res. 39, No. 8, 1812-1826 (2012).
3
On the complexity of partitioning graphs for arc-flags. (English)
Delling, Daniel (ed.) et al., 12th workshop on algorithmic approaches for transportation modelling, optimization, and systems, ATMOS’12, September 13, 2012, Ljubljana, Slovenia. Selected papers based on the presentations at the workshop. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-45-3). OASIcs ‒ OpenAccess Series in Informatics 25, 71-82, electronic only (2012).
4
On the complexity of partitioning graphs for arc-flags. (English)
Simões, Alberto (ed.) et al., 1st symposium on languages, applications and technologies, SLATE’12, June 21‒22, 2012, Braga, Portugal. Proceedings. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-40-8). OASIcs ‒ OpenAccess Series in Informatics 21, 71-82, electronic only (2012).
5
Dynamic approximate all-pairs shortest paths in undirected graphs. (English)
SIAM J. Comput. 41, No. 3, 670-683 (2012).
6
An efficient time and space $K$ point-to-point shortest simple paths algorithm. (English)
Appl. Math. Comput. 218, No. 20, 10244-10257 (2012).
7
An $O(n ^{3} \log\log n/\log ^{2} n)$ time algorithm for all pairs shortest paths. (English)
Fomin, Fedor V. (ed.) et al., Algorithm theory ‒ SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). Lecture Notes in Computer Science 7357, 131-141 (2012).
8
Computing feasible toolpaths for 5-axis machines. (English)
Theor. Comput. Sci. 447, 13-25 (2012).
9
Bidirectional $A^*$ search on time-dependent road networks. (English)
Networks 59, No. 2, 240-251 (2012).
10
Computing all-pairs shortest paths by leveraging low treewidth. (English)
J. Artif. Intell. Res. (JAIR) 43, 353-388 (2012).
11
Shortest paths in time-dependent FIFO networks. (English)
Algorithmica 62, No. 1-2, 416-435 (2012).
12
Weak disorder asymptotics in the stochastic mean-field model of distance. (English)
Ann. Appl. Probab. 22, No. 1, 29-69 (2012).
13
Faster batched shortest paths in road networks. (English)
Caprara, Alberto (ed.) et al., 11th workshop on algorithmic approaches for transportation modelling, optimization, and systems (ATMOS 2011). Selected papers based on the presentations at the workshop, September 8, 2011, Saarbrücken, Germany. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-33-0). OASIcs ‒ OpenAccess Series in Informatics 20, 52-63, electronic only (2011).
14
Biswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks. (English)
Int. J. Comput. Math. 88, No. 13, 2669-2684 (2011).
15
K$^{\ast}$: A heuristic search algorithm for finding the $k$ shortest paths. (English)
Artif. Intell. 175, No. 18, 2129-2154 (2011).
16
On subbetweennesses of trees: hardness, algorithms, and characterizations. (English)
Comput. Math. Appl. 62, No. 12, 4674-4681 (2011).
17
Connected components and minimum paths. (English)
Kepner, Jeremy (ed.) et al., Graph algorithms in the language of linear algebra. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898719-90-1/hbk). Software - Environments - Tools 22, 19-27 (2011).
18
A survey of geodesic paths on 3D surfaces. (English)
Comput. Geom. 44, No. 9, 486-498 (2011).
19
An evolutionary algorithm for the urban public transportation. (English)
Jędrzejowicz, Piotr (ed.) et al., Computational collective intelligence. Technologies and applications. Third international conference, ICCCI 2011, Gdynia, Poland, September 21‒23, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-23934-2/pbk). Lecture Notes in Computer Science 6922. Lecture Notes in Artificial Intelligence, 234-243 (2011).
20
Result 1 to 20 of 517 total
Start
Contact
Print
General Help
