Optimal attack and reinforcement of a network
Journal of the ACM (JACM)
Computational geometry: an introduction
Computational geometry: an introduction
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
A fast parametric maximum flow algorithm and applications
SIAM Journal on Computing
An almost linear time algorithm for generalized matrix searching
SIAM Journal on Discrete Mathematics
Applications of generalized matrix searching to geometric algorithms
Discrete Applied Mathematics - Computational combinatiorics
Can a maximum flow be computed in o(nm) time?
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Planar graph decomposition and all pairs shortest paths
Journal of the ACM (JACM)
Some generalized max-flow min-cut problems in the plane
Mathematics of Operations Research
ARIDAM III Selected papers on Third advanced research institute of discrete applied mathematics
Computing the strength of a graph
SIAM Journal on Computing
A faster deterministic maximum flow algorithm
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Improved algorithms for economic lot size problems
Operations Research
An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A graph-based system for network-vulnerability analysis
Proceedings of the 1998 workshop on New security paradigms
Increasing the weight of minimum spanning trees
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for robustness in matroid optimization
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Network design and improvement
ACM Computing Surveys (CSUR)
An improved FPTAS for restricted shortest path
Information Processing Letters
The Quickest Multicommodity Flow Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Practical Approximation Algorithms for Separable Packing Linear Programs
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
DOS-Resistant Authentication with Client Puzzles
Revised Papers from the 8th International Workshop on Security Protocols
Optimizing Cost Flows by Modifying Arc Costs and Capacities
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Resource Constrained Shortest Paths
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Floorplan Evaluation with Timing-Driven Global Wireplanning, Pin Assignment and Buffer/Wire Sizing
ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Heuristics for Multi-Stage Interdiction of Stochastic Networks
Journal of Heuristics
Efficient algorithms for robustness in resource allocation and scheduling problems
Theoretical Computer Science
Bounded-hops power assignment in ad hoc wireless networks
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
A Two-Sided Optimization for Theater Ballistic Missile Defense
Operations Research
Path selection under multiple QoS constraints - a practical approach
Journal of High Speed Networks
Real-Time Message Routing and Scheduling
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Bounded-hops power assignment in ad hoc wireless networks
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Depletable channels: dynamics and behaviour
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Approximation algorithms for k-hurdle problems
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Network flow interdiction on planar graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
A Dynamic Network Interdiction Problem
Informatica
Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
SIAM Journal on Optimization
A constrained binary knapsack approximation for shortest path network interdiction
Computers and Industrial Engineering
Extending Dijkstra's algorithm to maximize the shortest path by node-wise limited arc interdiction
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
On the existence of truthful mechanisms for the minimum-cost approximate shortest-paths tree problem
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Designing a truthful mechanism for a spanning arborescence bicriteria problem
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Operations Research Letters
A simple efficient approximation scheme for the restricted shortest path problem
Operations Research Letters
Approximation Techniques for Utilitarian Mechanism Design
SIAM Journal on Computing
Assessing the vulnerability of the fiber infrastructure to disasters
IEEE/ACM Transactions on Networking (TON)
Gelling, and melting, large graphs by edge manipulation
Proceedings of the 21st ACM international conference on Information and knowledge management
Packing interdiction and partial covering problems
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Optimal interdiction of attack plans
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
The resilience of WDM networks to probabilistic geographical failures
IEEE/ACM Transactions on Networking (TON)
The subdivision-constrained routing requests problem
Journal of Combinatorial Optimization
Hi-index | 0.00 |