MAPA: a system for inducing and visualizing hierarchy in Websites
Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems: links, objects, time and space---structure in hypermedia systems
Experimental analysis of dynamic algorithms for the single source shortest paths problem
Journal of Experimental Algorithmics (JEA)
ABCD: eliminating array bounds checks on demand
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
New dynamic algorithms for shortest path tree computation
IEEE/ACM Transactions on Networking (TON)
Efficiency by Incrementalization: An Introduction
Higher-Order and Symbolic Computation
New dynamic SPT algorithm based on a ball-and-string model
IEEE/ACM Transactions on Networking (TON)
Dynamic Graph Algorithms with Applications
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
On the Comparison-Addition Complexity of All-Pairs Shortest Paths
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Lifelong Planning for Mobile Robots
Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,
Eighteenth national conference on Artificial intelligence
Speeding up the calculation of heuristics for heuristic search-based planning
Eighteenth national conference on Artificial intelligence
A new approach to dynamic all pairs shortest paths
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
BANANAS: an evolutionary framework for explicit and multipath routing in the internet
FDNA '03 Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
Fully dynamic shortest paths in digraphs with arbitrary arc weights
Journal of Algorithms
Experimental analysis of dynamic all pairs shortest path algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Artificial Intelligence
Increasing Internet Capacity Using Local Search
Computational Optimization and Applications
Incremental heuristic search in AI
AI Magazine
A new approach to dynamic all pairs shortest paths
Journal of the ACM (JACM)
Maintaining Longest Paths Incrementally
Constraints
Geometric containers for efficient shortest-path computation
Journal of Experimental Algorithmics (JEA)
Avoiding instability during graceful shutdown of multiple OSPF routers
IEEE/ACM Transactions on Networking (TON)
Fully dynamic all pairs shortest paths with real edge weights
Journal of Computer and System Sciences - Special issue on FOCS 2001
Incremental computation of shortest paths in semi-dynamic graphs using software components
Proceedings of the 44th annual Southeast regional conference
Experimental analysis of dynamic all pairs shortest path algorithms
ACM Transactions on Algorithms (TALG)
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
High-level synthesis of DSP applications using adaptive negative cycle detection
EURASIP Journal on Applied Signal Processing
Anytime search in dynamic graphs
Artificial Intelligence
Discovering correlated spatio-temporal changes in evolving graphs
Knowledge and Information Systems
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
From High Girth Graphs to Hard Instances
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
MoonWalker: Verification of .NET Programs
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Memoised Garbage Collection for Software Model Checking
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Linear connectivity problems in directed hypergraphs
Theoretical Computer Science
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Shortest path discovery problems: a framework, algorithms and experimental results
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
Efficient implementations of heuristics for routing and wavelength assignment
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Grammar analysis and parsing by abstract interpretation
Program analysis and compilation, theory and practice
An integrated soft handoff approach to IP fast reroute in wireless mobile networks
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Point location in the continuous-time moving network
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Graph pattern matching: from intractable to polynomial time
Proceedings of the VLDB Endowment
Incremental graph pattern matching
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Grammar semantics, analysis and parsing by abstract interpretation
Theoretical Computer Science
Reactive imperative programming with dataflow constraints
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Snapshot Centrality Indices in Dynamic FIFO Networks
Journal of Mathematical Modelling and Algorithms
Survey of Motion Planning Literature in the Presence of Uncertainty: Considerations for UAV Guidance
Journal of Intelligent and Robotic Systems
ECML'05 Proceedings of the 16th European conference on Machine Learning
Improved dynamic algorithms for maintaining approximate shortest paths under deletions
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
An incremental heap canonicalization algorithm
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Complexity of linear connectivity problems in directed hypergraphs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Continuous-time moving network voronoi diagram
Transactions on Computational Science XIV
BDDRPA*: an efficient BDD-Based incremental heuristic search algorithm for replanning
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Dynamic graph query primitives for SDN-based cloudnetwork management
Proceedings of the first workshop on Hot topics in software defined networks
Structure theorems for optimum hyperpaths in directed hypergraphs
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Computers and Operations Research
Parallel dynamic spt update algorithm in OSPF
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Pay-as-you-go maintenance of precomputed nearest neighbors in large graphs
Proceedings of the 21st ACM international conference on Information and knowledge management
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract]
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Incremental graph pattern matching
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |