yusuke1997/dblp-id-title huggingface dataset:
Low Degree Connectivity in Ad-Hoc Networks
Distance Coloring
Fast and Compact Oracles for Approximate Distances in Planar Graphs
Nearly Tight Approximability Results for Minimum Biclique Cover and Partition
Online Makespan Scheduling with Job Migration on Uniform Machines
Exponential Lower Bounds for History-Based Simplex Pivot Rules on Abstract Cubes
Finding Social Optima in Congestion Games with Positive Externalities
Cloning Voronoi Diagrams via Retroactive Data Structures
Storing a Compressed Function with Constant Time Access
On the k-Splittable Flow Problem
Dynamic Colored Orthogonal Range Searching
PLS-Completeness of String Permutations
Breaking the O(m 2 n) Barrier for Minimum Cycle Bases
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects
Fisher Equilibrium Price with a Class of Concave Utility Functions
Experimental Variations of a Theoretically Good Retrieval Data Structure
A Deterministic Partition Tree and Applications
Lossy Dictionaries
Solving Directed Multiway Cut Faster Than 2ⁿ
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity
A Self-adjusting Data Structure for Multidimensional Point Sets
Coloring Tournaments with Few Colors: Algorithms and Complexity
Competivive Analysis of on-line Stack-Up Algorithms
From Graph to Hypergraph Multiway Partition: Is the Single Threshold the Only Route?
Extending Partial Representations of Function Graphs and Permutation Graphs
Scheduling Independent Multiprocessor Tasks
Kernelization Using Structural Parameters on Sparse Graph Classes
Approximating Earliest Arrival Flows in Arbitrary Networks
Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial
Streaming Graph Computations with a Helpful Advisor
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
Embedding Phylogenetic Trees in Networks of Low Treewidth
A Bridging Model for Multi-core Computing
Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄
Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph
Edge-Disjoint (s, t)-Paths on Undirected Planar Graphs in Linear Time
On the Efficiency of All-Pay Mechanisms
Recognizing Shrinkable Complexes Is NP-Complete
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
Delta-Stepping: A Parallel Single Source Shortest Path Algorithm
Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees
Approximating the Achromatic Number Problem on Bipartite Graphs
Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction
On the Complexity of BWT-Runs Minimization via Alphabet Reordering
An Improved Bound for Plane Covering Paths
Surface Reconstruction Between Simple Polygons via Angle Criteria
Near-Linear Algorithms for Visibility Graphs over a 1.5-Dimensional Terrain
A Doubling Dimension Threshold Theta (loglog n ) for Augmented Graph Navigability
Linear Size Binary Space Partitions for Fat Objects
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
A Constant Approximation for Colorful k-Center
Relative Convex Hulls in Semi-dynamic Subdivisions
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing
Approximation Algorithms for k-Line Center
Longest Common Subsequence from Fragments via Sparse Dynamic Programming
A Linear Algorithm for Edge-Coloring Partial k-Trees
Time Dependent Multi Scheduling of Multicast
Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
Fast Skeleton Construction
External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms
Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions
An Alternative Approach to Alternative Routes: HiDAR
Improved Routing on the Delaunay Triangulation
Induced Matchings in Subcubic Planar Graphs
TSP Tours in Cubic Graphs: Beyond 4/3
Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings
Fitting Tree Metrics with Minimum Disagreements
Fréchet Distance in Unweighted Planar Graphs
Improved Approximation Algorithms for Weighted 2-Path Partitions
Sliding Squares in Parallel
Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings
Stable Minimum Storage Merging by Symmetric Comparisons
Robust Matchings and Matroid Intersections
From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation
Semi-Streaming Algorithms for Weighted k-Disjoint Matchings
Dynamic vs. Oblivious Routing in Network Design
Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget
Faster Fully-Dynamic Minimum Spanning Forest
Constant-Factor FPT Approximation for Capacitated k-Median
Efficient Implementation of a Minimal Triangulation Algorithm
Approximate Parameterized Matching
Largest Chordal and Interval Subgraphs Faster Than 2 n
Deterministic Sampling Algorithms for Network Design
Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights
Finding Perfect Matchings in Bridgeless Cubic Multigraphs Without Dynamic (2-)connectivity
A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity
Approximating the Maximum Overlap of Polygons under Translation
A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension
Adaptability and the Usefulness of Hints (Extended Abstract)
Optimal External Memory Planar Point Enclosure
Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm
Predecessor Queries in Constant Time?
An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
Efficient Computation of 2-Covers of a String
The Voronoi Diagram of Planar Convex Objects
Radix Sorting with No Extra Space
Distant Representatives for Rectangles in the Plane
Single-Sink Fractionally Subadditive Network Design
PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors
Scheduling for Flow-Time with Admission Control
Euclidean Capacitated Vehicle Routing in the Random Setting: A 1.55-Approximation Algorithm
The Analysis of Linear Probing Hashing with Buckets (Extended Abstract)
On Generalized Gossiping and Broadcasting (Extended Abstract)
Seeking a Vertex of the Planar Matching Polytope in NC
Locally Computing Edge Orientations
Dimension Reduction via Colour Refinement
Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes
Improving Mergesort for Linked Lists
Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)
Tight Bounds for Active Self-assembly Using an Insertion Primitive
The Binomial Transform and its Application to the Analysis of Skip Lists
Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine
A Sweep-Plane Algorithm for Calculating the Isolation of Mountains
Deterministic Discrepancy Minimization
Improved Distance Oracles and Spanners for Vertex-Labeled Graphs
Paths, Flowers and Vertex Cover
Friendship and Stable Matching
Non-independent Randomized Rounding and an Application to Digital Halftoning
Streaming Geometric Optimization Using Graphics Hardware
Certified Approximation Algorithms for the Fermat Point and n-Ellipses
Hardness of Bichromatic Closest Pair with Jaccard Similarity
Beyond Optimal Play in Two-Person-Zerosum Games
Dynamic Dominators and Low-High Orders in DAGs
Faster Algorithms for Longest Common Substring
Online Bin Covering with Limited Migration
Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data
Nearest Neighbor Load Balancing on Graphs
Random-Order Online Independent Set of Intervals and Hyperrectangles
Improved Approximation Algorithms for Box Contact Representations
Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
On k-Means for Segments and Polylines
Approximation in Preemptive Stochastic Online Scheduling
Hardness of Detecting Abelian and Additive Square Factors in Strings
Navigating Low-Dimensional and Hierarchical Population Networks
3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth
On the Power of Advice and Randomization for Online Bipartite Matching
Spanner Approximations in Practice
Non-Boolean OMv: One More Reason to Believe Lower Bounds for Dynamic Problems
Aggregating over Dominated Points by Sorting, Scanning, Zip and Flat Maps
Off-Line Temporary Tasks Assignment
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs
Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings
Effective Resistances in Non-Expander Graphs
Online Occlusion Culling
A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP
On the Competitiveness of Linear Search
The Offset Filtration of Convex Objects
Evolution of an Algorithm
Engineering Fast Algorithms for the Bottleneck Matching Problem
Explicit Deterministic Constructions for Membership in the Bitprobe Model
On the Complexity of Recovering Incidence Matrices
Fast Witness Extraction Using a Decision Oracle
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming
Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing
Improved Dynamic Graph Coloring
Approximation Algorithms for Feasible Cut and Multicut Problems
On the Huffman and Alphabetic Tree Problem with General Cost Functions
I/O-Efficient Similarity Join
Homotopy Measures for Representative Trajectories
Dynamic Space Efficient Hashing
On the Satisfiability of Random 3-SAT Formulas with k-Wise Independent Clauses
Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks
Parallel Batch-Dynamic Trees via Change Propagation
Constructing Delaunay Triangulations along Space-Filling Curves
Succinct Representations of Arbitrary Graphs
Minimum Makespan Multi-vehicle Dial-a-Ride
Lossy Kernelization for (Implicit) Hitting Set Problems
Estimating Entropy over Data Streams
Decremental SPQR-trees for Planar Graphs
Exact Minkowski Sums of Polygons With Holes
On Element-Connectivity Preserving Graph Simplification
Bicriteria Approximation for Minimum Dilation Graph Augmentation
Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II
Recent Progress on Correlation Clustering: From Local Algorithms to Better Approximation Algorithms and Back (Invited Talk)
Arrangements in Geometry: Recent Advances and Challenges
Explicit Expanding Expanders
Necklaces, Convolutions, and X + Y
Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary
Faster Searching in Tries and Quadtrees - An Analysis of Level Compression
Algorithmic Meta-theorems for Restrictions of Treewidth
Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation
Kinetic Medians and kd-Trees
Optimal Algorithms for k -Search with Application in Option Pricing
Faster Local Motif Clustering via Maximum Flows
Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators
Strategic Contention Resolution with Limited Feedback
Online Bin Packing with Cardinality Constraints Resolved
Sublinear Distance Labeling
Extreme Points Under Random Noise
(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling
Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
Light Spanners for High Dimensional Norms via Stochastic Decompositions
Sparse Cut Projections in Graph Streams
5-Regular Graphs are 3-Colorable with Positive Probability
Lyndon Arrays Simplified
A Sub-Linear Time Framework for Geometric Optimization with Outliers in High Dimensions
Sublinear Computing
Efficient Algorithms foe On-Line Symbol Ranking Compression
Improved Purely Additive Fault-Tolerant Spanners
Parallel Complexity of Householder QR Factorization
Smoothed Motion Complexity
Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings
Parameterized Matroid-Constrained Maximum Coverage
The Power of Migration for Online Slack Scheduling
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
Smooth Distance Approximation
Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points
On Big Data Algorithmics
The Encoding Complexity of Two Dimensional Range Minimum Data Structures
Trip-Based Public Transit Routing
Non-clairvoyant Speed Scaling for Weighted Flow Time
Incresing the Vertex-Connectivity in Directed Graphs
Dictionary Matching in a Stream
Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
Range Searching in Categorical Data: Colored Range Searching on Grid
Convex Hull and Voronoi Diagram of Additively Weighted Points
Fast Output-Sensitive Matrix Multiplication
Color Distance Oracles and Snippets: Separation Between Exact and Approximate Solutions
A Fast Distributed Algorithm for Approximating the Maximum Matching
Fixed-Parameter Approximability of Boolean MinCSPs
Approximating Maximum-Size Properly Colored Forests
The Average Case Analysis of Partition Sorts
Approaching the 5/4-Approximation for Rectilinear Steiner Trees
Many-To-Many Polygon Matching à La Jaccard
Balancing Degree, Diameter and Weight in Euclidean Spanners
Shell: A Spatial Decomposition Data Structure for 3D Curve Traversal on Many-Core Architectures
Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract)
Tight Algorithms for Connectivity Problems Parameterized by Clique-Width
Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs
Online Bandwidth Allocation
Exploring an Unknown Graph Efficiently
Routing Regardless of Network Stability
An MINLP Solution Method for a Water Network Problem
Parallel Approximation Schemes for problems on planar graphs (Extended Abstract)
A Local-To-Global Theorem for Congested Shortest Paths
Faster 3-Coloring of Small-Diameter Graphs
Space Efficient Algorithms for the Burrows-Wheeler Backtransformation
Bundle Pricing with Comparable Items
On the Complexity of Anchored Rectangle Packing
Toward Self-Adjusting k-Ary Search Tree Networks
Computing NP-Hard Repetitiveness Measures via MAX-SAT
The Input/Output Complexity of Sparse Matrix Multiplication
Computing Upper and Lower Bounds on Textile Nesting Problems
The Online Transportation Problem
Balanced-Replication Algorithms for Distribution Trees
A General Framework for Enumerating Equivalence Classes of Solutions
Hitting Set for Hypergraphs of Low VC-dimension
Open Problems in Throughput Scheduling
Independent Range Sampling, Revisited
Prophet Secretary
Polygon Decomposition for Efficient Construction of Minkowski Sums
On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
Modeling Locality: A Probabilistic Analysis of LRU and FWF
Higher Order Delaunay Triangulations
On List Update and Work Function Algorithms
New Abilities and Limitations of Spectral Graph Bisection
On Minimum-Area Hulls (Extended Abstract)
Fréchet Distance for Curves, Revisited
Finding the Constrained Delaunay Triangulation and Constrainted Voronoi Diagram of a Simple Polygon in Linear-Time (Extended Abstract)
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Nash Equilibria: Where We Stand
Truthful and Competitive Double Auctions
Maximum Flow Networks for Stability Analysis of LEGO®Structures
Approximability of Sparse Integer Programs
On the Parallel Dynamic Dictionary Matching Problem: New Results with Applications
Distinct Elements in Streams: An Algorithm for the (Text) Book
Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-Known Theme
Recognizing Planar Laman Graphs
Parameterized Complexity of Equality MinCSP
Stability Yields Sublinear Time Algorithms for Geometric Optimization in Machine Learning
Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings
Algorithmic Building Blocks for Asymmetric Memories
Improved Approximation Algorithms for Tverberg Partitions
Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and Beyond
Optimization Algorithms For Large Networks
Maximizing Throughput in Multi-queue Switches
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks
Allocating Memory in a Lock-Free Manner
Computing Largest Common Point Sets under Approximate Congruence
Faster Exponential Algorithms for Cut Problems via Geometric Data Structures
Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result
Facility Location in Dynamic Geometric Data Streams
Bootstrapping Dynamic Distance Oracles
Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians
Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
The Minimum Shift Design Problem: Theory and Practice
All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error
Approximating k-Connected m-Dominating Sets
Grundy Distinguishes Treewidth from Pathwidth
Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
Efficient Contractions of Dynamic Graphs - With Applications
A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems
From Donkeys to Kings in Tournaments
Techniques for Scheduling with Rejection
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
Negative Cycle Detection Problem
Polynomial-Time Approximation Schemes for Circle Packing Problems
Fast Integer Programming in Fixed Dimension
Threshold Testing and Semi-Online Prophet Inequalities
On the Distribution of the Transitive Closure in a Random Acyclic Digraph
Quantified Linear Programs: A Computational Study
Optimal Layouts on a Chain ATM Network (Extended Abstract)
De-anonymization of Heterogeneous Random Graphs in Quasilinear Time
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions
Geometric Searching over the Rationals
Partially-Ordered Knapsack and Applications to Scheduling
Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs
Parameterized Complexity of the k-Arc Chinese Postman Problem
A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots
I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
Algorithms and Experiments for the Webgraph
An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering
Stronger ILPs for the Graph Genus Problem
Parameterized Hardness of Art Gallery Problems
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Relaxed Balance for Search Trees with Local Rebalancing
The Last Success Problem with Samples
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time
An Experimental Study of Algorithms for Fully Dynamic Transitive Closure
Better Approximation Algorithms for Technology Diffusion
Computational Biology - Algorithms and More
Cache-Oblivious Persistence
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods
Online Facility Location with Deletions
A Straight Skeleton Approximating the Medial Axis
Contribution Games in Social Networks
Rumor Spreading in Random Evolving Graphs
Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons
Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds
Preemptive Online Scheduling with Reordering
Linear Transformations Between Colorings in Chordal Graphs
Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut
Searching a Tree with Permanently Noisy Advice
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
Inefficiency of Standard Multi-unit Auctions
On Variable-Sized Multidimensional Packing
Negative-Cycle Detection Algorithms
On Minimum Power Connectivity Problems
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
Approximating Energy Efficient Paths in Wireless Multi-hop Networks
Short Labels for Lowest Common Ancestors in Trees
Car-Pooling as a Data Structuring Device: The Soft Heap
Bloomier Filters: A Second Look
On Representations of Algebraic-Geometric Codes for List Decoding
Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract)
On Diameter Approximation in Directed Graphs
Parameterized Algorithms for Diverse Multistage Problems
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
Scheduling Broadcasts in Wireless Networks
Ignorant vs. Anonymous Recommendations
Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice
Global Curve Simplification
Parallel Computation of Combinatorial Symmetries
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty
Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings
Robust Distance Queries on Massive Networks
An Inductive Construction for Plane Laman Graphs via Vertex Splitting
Dynamic Algorithms for Graph Spanners
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
A Bicriteria Approximation for the Reordering Buffer Problem
Cuts in Graphs with Matroid Constraints
Parameterized Quantum Query Algorithms for Graph Problems
The Price of Hierarchical Clustering
First Order Logic and Twin-Width in Tournaments
Improved Online Algorithms for Buffer Management in QoS Switches
Admissible Colourings of 3-Manifold Triangulations for Turaev-Viro Type Invariants
Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice
Disproof of the Neighborhood Conjecture with Implications to SAT
Minimal Triangulations for Graphs with "Few" Minimal Separators
Minimum Depth Graph Embedding
Geometric Hitting Sets for Disks: Theory and Practice
Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling
A General Decomposition Theorem for the k-Server Problem
Finding Dominators in Practice
A Local-Search 2-Approximation for 2-Correlation-Clustering
Patching Colors with Tensors
Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time
Compact Oblivious Routing in Weighted Graphs
Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints
A Loopless Gray Code for Minimal Signed-Binary Representations
A Unified Approach to Approximating Partial Covering Problems
Optimal Discovery Strategies in White Space Networks
Connectivity Oracles for Predictable Vertex Failures
Scope-Based Route Planning
Spectral Clustering by Recursive Partitioning
Counting and Sampling Labeled Chordal Graphs in Polynomial Time
On Online Labeling with Polynomially Many Labels
An Experimental Study on Approximating K Shortest Simple Paths
Bounding and Computing Obstacle Numbers of Graphs
Computing Optimal Linear Layouts of Trees in Linear Time
On Distance Oracles and Routing in Graphs
Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems
Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
Non-Cooperative Rational Interactive Proofs
On Randomized Algorithms for Matching in the Online Preemptive Model
Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings
Faster Algorithm for Second (s, t)-Mincut and Breaking Quadratic Barrier for Dual Edge Sensitivity for (s, t)-Mincut
Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems
Generating Realistic Terrains with Higher-Order Delaunay Triangulations
2-Connectivity in Directed Graphs
Online Metric TSP
Optimal Reconstruction of Graphs Under the Additive Model
The Effects of Local Randomness in the Adversarial Queueing Model
On the Depth of Randomly Generated Circuits
Narrow-Shallow-Low-Light Trees with and without Steiner Points