|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 10473 occurrences of 4385 keywords
|
|
|
Results
Found 17726 publication records. Showing 17726 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
21 | Brice Augustin, Timur Friedman, Renata Teixeira |
Measuring load-balanced paths in the internet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Internet Measurement Conference ![In: Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference, IMC 2007, San Diego, California, USA, October 24-26, 2007, pp. 149-160, 2007, ACM, 978-1-59593-908-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
load balancing, multipath, path diversity, traceroute |
21 | Srecko Brlek, Elisa Pergola, Olivier Roques |
Non uniform random generation of generalized Motzkin paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 42(8-9), pp. 603-616, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Generalized Motzkin path, Random generation, Rejection |
21 | Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis A. Goddyn, Michael Lohman, Paul D. Seymour |
Packing Non-Zero A-Paths In Group-Labelled Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(5), pp. 521-532, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C22 |
21 | Randeep Bhatia, Murali S. Kodialam, T. V. Lakshman |
Finding disjoint paths with related path costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 12(1-2), pp. 83-96, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Hyesoon Kim, José A. Joao, Onur Mutlu, Yale N. Patt |
Diverge-Merge Processor (DMP): Dynamic Predicated Execution of Complex Control-Flow Graphs Based on Frequently Executed Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICRO ![In: 39th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO-39 2006), 9-13 December 2006, Orlando, Florida, USA, pp. 53-64, 2006, IEEE Computer Society, 0-7695-2732-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Andrea De Mauro, Dan Schonfeld, Claudio Casetti |
A Peer-to-Peer Overlay Network for Real Time Video Communication using Multiple Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICME ![In: Proceedings of the 2006 IEEE International Conference on Multimedia and Expo, ICME 2006, July 9-12 2006, Toronto, Ontario, Canada, pp. 921-924, 2006, IEEE Computer Society, 1-4244-0367-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Yanzhi Li, Andrew Lim 0001, Hong Ma |
A Hybrid Genetic Algorithm for Solving the Length-Balanced Two Arc-Disjoint Shortest Paths Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE ![In: Advances in Applied Artificial Intelligence, 19th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2006, Annecy, France, June 27-30, 2006, Proceedings, pp. 272-281, 2006, Springer, 3-540-35453-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
length-balanced, shortest path, Lagrangian relaxation |
21 | Anxiao Jiang, Jehoshua Bruck |
Multicluster interleaving on paths and cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(2), pp. 597-611, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Torsten Tholey |
Finding Disjoint Paths on Directed Acyclic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 319-330, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Egon Wanke, Rolf Kötter |
Oriented Paths in Mixed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 629-643, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Edge-Disjoint Paths in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 71-80, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Tamer Nadeem, Suman Banerjee 0001, Archan Misra, Ashok K. Agrawala |
Energy-Efficient Reliable Paths for On-Demand Routing Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MWCN ![In: Mobile and Wireless Communication Networks, IFIP TC6 / WG6.8 Conference on Mobile and Wireless Communication Networks (MWCN 2004), October 25-27, 2004, Paris, France, pp. 485-496, 2004, Kluwer/Springer, 0-387-23148-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Jianhui Xing, Hong Wang, Shiyuan Yang |
Constructing Transparency Paths for IP Cores Using Greedy Searching Strategy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 13th Asian Test Symposium (ATS 2004), 15-17 November 2004, Kenting, Taiwan, pp. 14-19, 2004, IEEE Computer Society, 0-7695-2235-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Klaus Weinert, Marc Stautner |
Generating Multiaxis Tool Paths for Die and Mold Making with Evolutionary Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO (2) ![In: Genetic and Evolutionary Computation - GECCO 2004, Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26-30, 2004, Proceedings, Part II, pp. 1287-1298, 2004, Springer, 3-540-22343-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Nicolas Markey, Jean-François Raskin |
Model Checking Restricted Sets of Timed Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31 - September 3, 2004, Proceedings, pp. 432-447, 2004, Springer, 3-540-22940-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Eric Saund |
Finding Perceptually Closed Paths in Sketches and Drawings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 25(4), pp. 475-491, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Contour closure, closed path, Gestalt laws, sketch interpretation, line art analysis, graphics recognition, perceptual organization |
21 | Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano, Anastasios Sidiropoulos |
Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers, pp. 81-94, 2003, Springer, 3-540-21079-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Michael Gerharz, Christian de Waal, Peter Martini, Paul James |
Strategies for Finding Stable Paths in Mobile Wireless Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: 28th Annual IEEE Conference on Local Computer Networks (LCN 2003), The Conference on Leading Edge and Practical Computer Networking, 20-24 October 2003, Bonn/Königswinter, Germany, Proceedings, pp. 130-139, 2003, IEEE Computer Society, 0-7695-2037-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Budhaditya Deb, Sudeept Bhatnagar, Badri Nath |
ReInForM: Reliable Information Forwarding Using Multiple Paths in Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: 28th Annual IEEE Conference on Local Computer Networks (LCN 2003), The Conference on Leading Edge and Practical Computer Networking, 20-24 October 2003, Bonn/Königswinter, Germany, Proceedings, pp. 406-415, 2003, IEEE Computer Society, 0-7695-2037-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Weifa Liang, Xiaojun Shen 0002 |
Finding Multiple Routing Paths in Wide-Area WDM Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP Workshops ![In: 31st International Conference on Parallel Processing Workshops (ICPP 2002 Workshops), 20-23 August 2002, Vancouver, BC, Canada, pp. 199-206, 2002, IEEE Computer Society, 0-7695-1680-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Shunan Lin, Yao Wang 0001, Shiwen Mao, Shivendra S. Panwar |
Video transport over ad-hoc networks using multiple paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (1) ![In: Proceedings of the 2002 International Symposium on Circuits and Systems, ISCAS 2002, Scottsdale, Arizona, USA, May 26-29, 2002, pp. 57-60, 2002, IEEE, 0-7803-7448-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Dimiter R. Avresky, Vladimir Shurbanov, Natcho H. Natchev, F. Zuccarino, Pankaj Mehra |
Optimal Utilization of Equivalent Paths in Computer Networks with Static Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NCA ![In: IEEE International Symposium on Network Computing and Applications (NCA 2001), October 8-10, 2001, Cambridge, MA, USA, pp. 133-144, 2001, IEEE Computer Society, 0-7695-1432-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Shunan Lin, Shiwen Mao, Yao Wang 0001, Shivendra S. Panwar |
A Reference Picture Selection Scheme For Video Transmission Over Ad-Hoc Networks Using Multiple Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICME ![In: Proceedings of the 2001 IEEE International Conference on Multimedia and Expo, ICME 2001, August 22-25, 2001, Tokyo, Japan, 2001, IEEE Computer Society, 0-7695-1198-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Michael Elkin |
Computing almost shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC 2001, Newport, Rhode Island, USA, August 26-29, 2001, pp. 53-62, 2001, ACM, 1-58113-383-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Valerie King |
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 81-91, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
21 | Sébastien Fourey, Rémy Malgouyres |
Intersection Number of Paths Lying on a Digital Surface and a New Jordan Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 8th International Conference, DCGI'99, Marne-la-Vallee, France, March 17-19, 1999, Proceedings, pp. 104-117, 1999, Springer, 3-540-65685-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
surfels curves, Digital topology, digital surfaces |
21 | Philip N. Klein, Sairam Subramanian |
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 22(3), pp. 235-249, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Minimum-cost path, Minimum-cost path, Shortest path, Shortest path, Graph algorithm, Graph algorithm, Planar graph, Planar graph, Key words, Dynamic algorithm, Dynamic algorithm |
21 | Eric Ruppert |
Finding the k Shortest Paths in Parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings, pp. 475-486, 1997, Springer, 3-540-62616-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Topics parallel algorithms, data structures |
21 | David Hartvigsen |
Generalized Max Flows and Augmenting Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings, pp. 185-197, 1995, Springer, 3-540-59408-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
21 | Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe |
Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings, pp. 343-352, 1993, Springer, 3-540-57568-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
21 | Arch D. Robison |
A group of permutations with edge-disjoint paths on hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPDP ![In: Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, SPDP 1991, 2-5 December 1991, Dallas, Texas, USA, pp. 746-749, 1991, IEEE Computer Society, 0-8186-2310-1. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
21 | Jacques Benkoski, E. Vanden Meersch, Luc J. M. Claesen, Hugo De Man |
Timing verification using statically sensitizable paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(10), pp. 10723-10784, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
21 | Andreas Schwill |
Nonblocking Graphs: Greedy Algorithms to Compute Disjoint Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990, Proceedings, pp. 250-262, 1990, Springer, 3-540-52282-4. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
21 | James M. Bieman, Janet L. Schultz |
Estimating the Number of Test Cases Required to Satisfy the All-du-paths Testing Criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symposium on Testing, Analysis, and Verification ![In: Proceedings of the ACM SIGSOFT '89 Third Symposium on Testing, Analysis, and Verification, TAV 1989, Key West, Florida, USA, December 13-15, 1989, pp. 179-186, 1989, ACM, 0-89791-342-6. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
21 | Derek F. Yates, Nicos Malevris |
Reducing the Effects of Infeasible Paths in Branch Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symposium on Testing, Analysis, and Verification ![In: Proceedings of the ACM SIGSOFT '89 Third Symposium on Testing, Analysis, and Verification, TAV 1989, Key West, Florida, USA, December 13-15, 1989, pp. 48-54, 1989, ACM, 0-89791-342-6. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
20 | Lin Xie, Azadeh Davoodi |
Representative path selection for post-silicon timing prediction under variability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 47th Design Automation Conference, DAC 2010, Anaheim, California, USA, July 13-18, 2010, pp. 386-391, 2010, ACM, 978-1-4503-0002-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
process variations, post-silicon validation |
20 | Mohand Yazid Saidi, Bernard Cousin, Jean-Louis Le Roux |
Backup Path Classification Based on Failure Risks for Efficient Backup Path Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networking ![In: NETWORKING 2009, 8th International IFIP-TC 6 Networking Conference, Aachen, Germany, May 11-15, 2009. Proceedings, pp. 509-520, 2009, Springer, 978-3-642-01398-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
local protection, backup path computation, network, MPLS, survivability, resource optimization, Shared Risk Link Group (SRLG) |
20 | Maren Martens |
A Simple Greedy Algorithm for the k-Disjoint Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings, pp. 291-300, 2009, Springer, 978-3-642-02016-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Kunal Taneja, Tao Xie 0001, Nikolai Tillmann, Jonathan de Halleux, Wolfram Schulte |
Guided path exploration for regression test generation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSE Companion ![In: 31st International Conference on Software Engineering, ICSE 2009, May 16-24, 2009, Vancouver, Canada, Companion Volume, pp. 311-314, 2009, IEEE, 978-1-4244-3494-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Nicholas Callegari, Li-C. Wang, Pouria Bastani |
Speedpath analysis based on hypothesis pruning and ranking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 46th Design Automation Conference, DAC 2009, San Francisco, CA, USA, July 26-31, 2009, pp. 346-351, 2009, ACM, 978-1-60558-497-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
speedpath, data mining, timing analysis |
20 | Stephan Bohacek |
Performance Improvements Provided by Route Diversity in Multihop Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Mob. Comput. ![In: IEEE Trans. Mob. Comput. 7(3), pp. 372-384, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Wireless communication, Routing protocols, Network communications |
20 | Michael S. Branicky, Ross A. Knepper, James J. Kuffner |
Path and trajectory diversity: Theory and algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICRA ![In: 2008 IEEE International Conference on Robotics and Automation, ICRA 2008, May 19-23, 2008, Pasadena, California, USA, pp. 1359-1364, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Ioan Alexandru Sucan, Jonathan F. Kruse, Mark Yim, Lydia E. Kavraki |
Kinodynamic motion planning with hardware demonstrations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IROS ![In: 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems, September 22-26, 2008, Acropolis Convention Center, Nice, France, pp. 1661-1666, 2008, IEEE, 978-1-4244-2057-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Shaoyin Cheng, Fan Jiang 0005, Jiajie Wang, Tao Zhang, Xuezhi Xing |
DBTG: Demand-Driven Backtracking Test Generation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICYCS ![In: Proceedings of the 9th International Conference for Young Computer Scientists, ICYCS 2008, Zhang Jia Jie, Hunan, China, November 18-21, 2008, pp. 1944-1950, 2008, IEEE Computer Society, 978-0-7695-3398-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Murali Krishna Ramanathan, Koushik Sen, Ananth Grama, Suresh Jagannathan |
Protocol Inference Using Static Path Profiles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 15th International Symposium, SAS 2008, Valencia, Spain, July 16-18, 2008. Proceedings, pp. 78-92, 2008, Springer, 978-3-540-69163-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Somitra Kumar Sanadhya, Palash Sarkar 0001 |
Non-linear Reduced Round Attacks against SHA-2 Hash Family. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 13th Australasian Conference, ACISP 2008, Wollongong, Australia, July 7-9, 2008, Proceedings, pp. 254-266, 2008, Springer, 978-3-540-69971-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Juan Jose Galvez, Pedro M. Ruiz, Antonio Fernandez Gómez-Skarmeta |
Spatially Disjoint Multipath Routing protocol without location information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: LCN 2008, The 33rd IEEE Conference on Local Computer Networks, The Conference on Leading Edge and Practical Computer Networking, Hyatt Regency Montreal, Montreal, Quebec, Canada, 14-17 October 2008, Proceedings, pp. 570-571, 2008, IEEE Computer Society, 978-1-4244-2412-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Yigal Bejerano, Seung-Jae Han, Keon-Taek Lee, Amit Kumar 0001 |
Single-path routing for life time maximization in multi-hop wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: LCN 2008, The 33rd IEEE Conference on Local Computer Networks, The Conference on Leading Edge and Practical Computer Networking, Hyatt Regency Montreal, Montreal, Quebec, Canada, 14-17 October 2008, Proceedings, pp. 160-167, 2008, IEEE Computer Society, 978-1-4244-2412-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Vincent Borrel, Mostafa H. Ammar, Ellen W. Zegura |
Understanding the wireless and mobile network space: a routing-centered classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Challenged Networks ![In: Proceedings of the Second Workshop on Challenged Networks, CHANTS 2007, Montréal, Québec, Canada, September 14, 2007, pp. 11-18, 2007, ACM, 978-1-59593-737-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
classification, routing, DTN |
20 | Pascal Mérindol, Jean-Jacques Pansiot, Stéphane Cateloin |
Path Computation for Incoming Interface Multipath Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECUMN ![In: Fourth European Conference on Universal Multiservice Networks (ECUMN 2007), 14-16 February 2007, Toulouse, France, pp. 75-85, 2007, IEEE Computer Society, 978-0-7695-2768-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Viet Q. Phung, Daryoush Habibi, Hoang Nam Nguyen |
On Diverse Routing for Shared Risk Link Groups (SRLGs) in Optical Mesh Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICON ![In: Proceedings of the 15th IEEE International Conference on Networks, ICON 2007, 19-21 November 2007, Adelaide, Australia, pp. 235-239, 2007, IEEE, 1-4244-1230-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong 0001, Michael Kaufmann 0001, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis |
Colored Simultaneous Geometric Embeddings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, pp. 254-263, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Wankang Zhao, William C. Kreahling, David B. Whalley, Christopher A. Healy, Frank Mueller 0001 |
Improving WCET by applying worst-case path optimizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Real Time Syst. ![In: Real Time Syst. 34(2), pp. 129-152, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Path-based optimizations, Embedded systems, WCET |
20 | Thomas Erlebach, Alexander Hall, Linda S. Moonen, Alessandro Panconesi, Frits C. R. Spieksma, Danica Vukadinovic |
Robustness of the Internet at the Topology and Routing Level. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Research Results of the DICS Program ![In: Dependable Systems: Software, Computing, Networks, Research Results of the DICS Program, pp. 260-274, 2006, Springer, 3-540-36821-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Stephen Mueller, Dipak Ghosal |
Analysis of a Distributed Algorithm to Determine Multiple Routes with Path Diversity in Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WiOpt ![In: 3rd International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt 2005), 4-6 April 2005, Trentino, Italy, pp. 277-285, 2005, IEEE Computer Society, 0-7695-2267-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Najah A. Abu Ali, Hussein T. Mouftah, Saeed Gazor |
Multi-Path Traffic Engineering Distributed VPLS Routing Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Systems Communications ![In: Systems Communications 2005 (ICW / ICHSN / ICMCS / SENET 2005), 14-17 August 2005, Montreal, Canada, pp. 275-280, 2005, IEEE Computer Society, 0-7695-2422-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Qiang Li 0008, Qinyuan Feng, Liang Hu 0001, Jiubin Ju |
Fast Two Phrases PPM for IP Traceback. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2005), 5-8 December 2005, Dalian, China, pp. 386-389, 2005, IEEE Computer Society, 0-7695-2405-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Constantino M. Lagoa, Hao Che, Bernardo A. Movsichoff |
Adaptive control algorithms for decentralized optimal traffic engineering in the internet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 12(3), pp. 415-428, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
optimization, traffic engineering, sliding mode control |
20 | Xiang Lu, Zhuo Li 0001, Wangqi Qiu, D. M. H. Walker, Weiping Shi |
Longest path selection for delay test under process variation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC ![In: Proceedings of the 2004 Conference on Asia South Pacific Design Automation: Electronic Design and Solution Fair 2004, Yokohama, Japan, January 27-30, 2004, pp. 98-103, 2004, IEEE Computer Society, 0-7803-8175-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Irith Pomeranz, Sudhakar M. Reddy |
A Postprocessing Procedure of Test Enrichment for Path Delay Faults. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 13th Asian Test Symposium (ATS 2004), 15-17 November 2004, Kenting, Taiwan, pp. 448-453, 2004, IEEE Computer Society, 0-7695-2235-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Puneet Gupta, Michael S. Hsiao |
High Quality ATPG for Delay Defects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITC ![In: Proceedings 2003 International Test Conference (ITC 2003), Breaking Test Interface Bottlenecks, 28 September - 3 October 2003, Charlotte, NC, USA, pp. 584-591, 2003, IEEE Computer Society, 0-7803-8106-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
20 | Panagiotis Papadimitratos, Zygmunt J. Haas, Emin Gün Sirer |
Path set selection in mobile ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 3rd ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2002, June 9-11, 2002, Lausanne, Switzerland, pp. 1-11, 2002, ACM, 1-58113-501-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
path set selection, reliability, mobile ad hoc networks |
20 | Kitt Tientanopajai, Kanchana Kanchanasut |
Multiconstraint QoS Routing Using a Path-Vector Protocol. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIAN ![In: Advances in Computing Science - ASIAN 2002, Internet Computing and Modeling, Grid Computing, Peer-to-Peer Computing, and Cluster Computing, 7th Asian Computing Science Conference, Hanoi, Vietnam, December 4-6, 2002, Proceedings, pp. 181-194, 2002, Springer, 3-540-00195-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Thomas Erlebach |
Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 351-362, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
20 | Angela Krstic, Kwang-Ting Cheng, Srimat T. Chakradhar |
Primitive delay faults: identification, testing, and design for testability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(6), pp. 669-684, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
20 | Yuji Kukimoto, Robert K. Brayton |
Timing-safe false path removal for combinational modules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1999 IEEE/ACM International Conference on Computer-Aided Design, 1999, San Jose, California, USA, November 7-11, 1999, pp. 544-550, 1999, IEEE Computer Society, 0-7803-5832-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
20 | Angela Krstic, Kwang-Ting Cheng |
Resynthesis of Combinational Circuits for Path Count Reduction and for Path Delay Fault Testability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Electron. Test. ![In: J. Electron. Test. 11(1), pp. 43-54, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
resynthesis for testability, timing defects, delay testing, path delay faults, VLSI testing |
20 | Spyros Tragoudas, Yaakov L. Varol |
Computing Disjoint Path with Lenght Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings, pp. 375-389, 1996, Springer, 3-540-62559-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
20 | Haruo Takeda, Claudio Facchinetti, Jean-Claude Latombe |
Planning the Motions of a Mobile Robot in a Sensory Uncertainty Field. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 16(10), pp. 1002-1017, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
laser ranging, sensory uncertainty field, robot configuration, localization function, classical line-striping camera/laser range sensor, motion planner, navigation, mobile robots, mobile robot, path planning, computerised navigation, environment model, path length |
19 | Jérôme Berclaz, François Fleuret, Engin Türetken, Pascal Fua |
Multiple Object Tracking Using K-Shortest Paths Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 33(9), pp. 1806-1819, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
multiobject tracking, linear programming, Data association, K-shortest paths |
19 | Guanfeng Liu 0001, Yan Wang 0002, Mehmet A. Orgun |
Finding K Optimal Social Trust Paths for the Selection of Trustworthy Service Providers in Complex Social Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICWS ![In: IEEE International Conference on Web Services, ICWS 2011, Washington, DC, USA, July 4-9, 2011, pp. 41-48, 2011, IEEE Computer Society, 978-1-4577-0842-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
K paths selection, service provider selection, social networks, trust |
19 | Ozgur Sinanoglu, Mehmet Hakan Karaata, Bader F. AlBdaiwi |
An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 59(7), pp. 995-999, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
inherent stabilization, Fault-tolerance, stabilization, hypercube networks, node-disjoint paths |
19 | Thomas Bochot, Pierre Virelizier, Hélène Waeselynck, Virginie Wiels |
Paths to Property Violation: A Structural Approach for Analyzing Counter-Examples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HASE ![In: 12th IEEE High Assurance Systems Engineering Symposium, HASE 2010, San Jose, CA, USA, November 3-4, 2010, pp. 74-83, 2010, IEEE Computer Society, 978-1-4244-9091-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Analysis of counterexamples, SCADE models, structural paths |
19 | Ruen Chze Loh, Sieteng Soh, Mihai M. Lazarescu |
Maximizing Bandwidth Using Disjoint Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AINA ![In: 24th IEEE International Conference on Advanced Information Networking and Applications, AINA 2010, Perth, Australia, 20-13 April 2010, pp. 304-311, 2010, IEEE Computer Society, 978-0-7695-4018-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
maximum bandwidth, path bandwidth, edge-disjoint paths, network bandwidth, network QoS |
19 | Aaron Bernstein |
Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 693-702, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, shortest paths, graph algorithms, dynamic algorithms |
19 | Ruen Chze Loh, Sieteng Soh, Mihai M. Lazarescu |
An Approach to Find Maximal Disjoint Paths with Reliability and Delay Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AINA ![In: The IEEE 23rd International Conference on Advanced Information Networking and Applications, AINA 2009, Bradford, United Kingdom, May 26-29, 2009, pp. 959-964, 2009, IEEE Computer Society, 978-0-7695-3638-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
multi-constrained edge disjoint paths, approximate algorithm, network reliability, network delay, Lagrange relaxation |
19 | Tobias Friedrich 0001, Nils Hebbinghaus |
Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 692-703, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
shortest paths, random graphs, average-case analysis, Dynamic graph algorithms |
19 | Yann Disser, Matthias Müller-Hannemann, Mathias Schnee |
Multi-criteria Shortest Paths in Time-Dependent Train Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental Algorithms, 7th International Workshop, WEA 2008, Provincetown, MA, USA, May 30-June 1, 2008, Proceedings, pp. 347-361, 2008, Springer, 978-3-540-68548-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
time-dependent graphs, case study, shortest paths, multi-criteria optimization, speed-up techniques |
19 | Ronald I. Becker, Isabella Lari, Andrea Scozzari, Giovanni Storchi |
The location of median paths on grid graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 150(1), pp. 65-78, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Median paths, Facility location, Grid graphs |
19 | Valentin Polishchuk, Joseph S. B. Mitchell |
Thick non-crossing paths and minimum-cost flows in polygonal domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, pp. 56-65, 2007, ACM, 978-1-59593-705-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
geometric shortest paths, data structures, minimum-cost flows |
19 | Zhendong Wu, Shanping Li |
An Adaptive Multi-paths Algorithm for Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICESS ![In: Embedded Software and Systems, [Third] International Conference, ICESS 2007, Daegu, Korea, May 14-16, 2007, Proceedings, pp. 686-698, 2007, Springer, 978-3-540-72684-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Adaptive Multi-paths, Local Minimum Phenomenon, Right hand rule, Sensor Networks |
19 | Gyula Pap |
Some new results on node-capacitated packing of A-paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 599-604, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
node-capacities, paths-packing, algorithms |
19 | Mikkel Thorup |
Worst-case update times for fully-dynamic all-pairs shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 112-119, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
worst-case update times, shortest paths, dynamic graph algorithms |
19 | Eric Klassen, Anuj Srivastava, Washington Mio, Shantanu H. Joshi |
Analysis of Planar Shapes Using Geodesic Paths on Shape Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 26(3), pp. 372-383, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
geodesic paths, shape statistics, intrinsic mean shapes, shape-based clustering, shape interpolation, Shape metrics |
19 | Pierre Fransson, Lenka Carr-Motycková |
Brief announcement: an incremental algorithm for calculation of backup-paths in link-state networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004, pp. 381, 2004, ACM, 1-58113-802-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
backup-paths, link-state networks, routing |
19 | Rezaul Alam Chowdhury, Vijaya Ramachandran |
Cache-oblivious shortest paths in graphs using buffer heap. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 27-30, 2004, Barcelona, Spain, pp. 245-254, 2004, ACM, 1-58113-840-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
buffer heap, cache-aware model, cache-oblivious model, decrease-key, tournament tree, shortest paths, priority queue |
19 | József Balogh, Oded Regev 0001, Clifford D. Smyth, William L. Steiger, Mario Szegedy |
Long monotone paths in line arrangements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 19th ACM Symposium on Computational Geometry, San Diego, CA, USA, June 8-10, 2003, pp. 124-128, 2003, ACM, 1-58113-663-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
discrete line arrangements, monotone paths |
19 | Bin Xu 0009, Danny Z. Chen, Robert J. Szczerba |
Determining optimal paths in a weighted and dynamic 2D environment using framed-octrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Agents ![In: Proceedings of the Fourth International Conference on Autonomous Agents, AGENTS 2000, Barcelona, Catalonia, Spain, June 3-7, 2000, pp. 29-30, 2000, ACM, 1-58113-230-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
cell decomposition, framed-octrees, union-find structure, computational geometry, path planning, optimal paths |
19 | Shinji Inoue, Yoshiaki Kakuda |
Multiple Backup Virtual Paths Reservation Problem and Its Solution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICECCS ![In: 6th International Conference on Engineering of Complex Computer Systems (ICECCS 2000), 11-15 September 2000, Tokyo, Japan, pp. 122-, 2000, IEEE Computer Society, 0-7695-0583-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
multiple backup virtual paths reservation problem, backup virtual path, primary VP, reliable computer network, multiple failures, pairwise backup VP, multiagent based method, computer network reliability |
19 | Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan |
Approximating shortest paths on a convex polytope in three dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 44(4), pp. 567-584, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
approximation algorithms, convex polytopes, Euclidean shortest paths |
19 | Dorit Dor, Shay Halperin, Uri Zwick |
All Pairs Almost Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 452-461, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
all pairs almost shortest paths, unweighted undirected graph, matrix multiplication algorithm, 3-spanner, weighted undirected graph, matrix multiplication, vertices, Boolean matrix multiplication |
19 | Jon M. Kleinberg, Ronitt Rubinfeld |
Short Paths in Expander Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 86-95, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
inter-connection networks, disjoint paths problem, graph minor containment, polylogarithmic approximation, routing algorithms, greedy algorithm, network routing, multicommodity flow, expander graphs |
19 | Hiroshi Takahashi, Nobuhiro Yanagida, Yuzo Takamatsu |
Enhancing multiple fault diagnosis in combinational circuits based on sensitized paths and EB testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 4th Asian Test Symposium (ATS '95), November 23-24, 1995. Bangalore, India, pp. 58-64, 1995, IEEE Computer Society, 0-8186-7129-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
electron beam testing, multiple fault diagnosis, sensitized paths, EB testing, TP-1, TP-2, TP-3, TP-4, electron-beam tester, internal lines, VLSI, fault diagnosis, logic testing, combinational circuits, combinational circuits, fault location, fault location, stuck-at faults, diagnostic resolution |
19 | David Eppstein |
Finding the k Shortest Paths ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 154-165, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
maximum inscribed polygons, implicit representation, dynamic programming problems, algorithms, sequence alignment, knapsack problem, vertices, digraph, k shortest paths |
19 | Philip N. Klein, Sairam Subramanian |
A linear-processor polylog-time algorithm for shortest paths in planar graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 259-270, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
linear-processor polylog-time algorithm, directed planar graphs, bounded-genus graphs, 2-dimensional overlap graphs, shortest paths, planar graphs, separators, decomposition tree |
19 | Noga Alon, Zvi Galil, Oded Margalit, Moni Naor |
Witnesses for Boolean Matrix Multiplication and for Shortest Paths ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 417-426, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
subcubic methods, shortest paths, deterministic algorithm, transitive closure, witnesses, Boolean matrix multiplication |
19 | Miklós Ajtai, Noga Alon, Jehoshua Bruck, Robert Cypher, Ching-Tien Ho, Moni Naor, Endre Szemerédi |
Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 693-702, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
k-fault tolerant graph, performance degradation, disjoint paths, perfect hash functions |
19 | Greg N. Frederickson |
Planar Graph Decomposition and All Pairs Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 38(1), pp. 162-204, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
succinct encoding, approximation algorithm, NP-completeness, planar graph, graph embedding, all pairs shortest paths, outerplanar graph, compact routing table |
19 | Michael L. Fredman, Dan E. Willard |
Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 719-725, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
Fibonacci heap, trans-dichotomous algorithms, fusion tree method, information-theoretic limitations, atomic heap, amortized time, heap size, AF-heap, data structure, shortest paths, minimum spanning trees, linear-time algorithm, shortest-path algorithm |
19 | Greg N. Frederickson |
Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems (Preliminary Version) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 448-453, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
topological embedding, cellular graph embeddings, shortest path information, time complexity, shortest paths problems |
Displaying result #301 - #400 of 17726 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ >>] |
|