yusuke1997/dblp-id-title huggingface dataset:
On Finding Small 2-Generating Sets
Election Control Through Social Influence with Unknown Preferences
Online Knapsack Problem with Removal Cost
Information Complexity of the AND Function in the Two-Party and Multi-party Settings
Restricted Max-Min Fair Allocations with Inclusion-Free Intervals
An Improved Approximation Algorithm for Uncapacitated Facility Location Problem with Penalties
Size and Variable Ordering of OBDDs Representing Treshold Functions
On the Complexity of Computing Evolutionary Trees
Revisit the Partial Coloring Method: Prefix Spencer and Sampling
Optimal Stopping Meets Combinatorial Optimization
Volume Computation Using a Direct Monte Carlo Method
Path-Monotonic Upward Drawings of Graphs
Membership for Core of LP Games and Other Games
An FPT Algorithm for Contraction to Cactus
An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs
Selection from Read-Only Memory with Limited Workspace
Efficient Respondents Selection for Biased Survey Using Online Social Networks
Escape from the Room
A Quantum Version of Pollard's Rho of Which Shor's Algorithm is a Particular Case
On the Complexity of Solving or Approximating Convex Recoloring Problems
Approximation Complexity of Complex-Weighted Degree-Two Counting Constraint Satisfaction Problems
Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs
Centrality and Spectral Radius in Dynamic Communication Networks
Stacks versus Deques
A Notion of Cross-Perfect Bipartite Graphs
Algorithms for Finding Distance-Edge-Colorings of Graphs
A Multi-start Variable Neighborhood Tabu Search Algorithm for the Cyclic Bandwidth Problem
Car-Sharing Between Two Locations: Online Scheduling with Flexible Advance Bookings
On-Line Deadline Scheduling on Multiple Resources
Computing and Combinatorics - 30th International Conference, COCOON 2024, Shanghai, China, August 23-25, 2024, Proceedings, Part II
A Competitive Online Algorithm for the Paging Problem with "Shelf" Memory
On the Relationship Between Energy Complexity and Other Boolean Function Measures
An 8/5-Approximation Algorithm for a Hard Variant of Stable Marriage
On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries
RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal Gene Transfer
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming
Disjoint Path Allocation with Sublinear Advice
Tile-Packing Tomography Is \mathbb NP {\mathbb{NP}}-hard
Radial Coordinate Assignment for Level Graphs
Zero-Knowledge Argument for Simultaneous Discrete Logarithms
Approximately Uniform Online Checkpointing
A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet
Co-orthogonal Codes
Computing Farthest Neighbors on a Convex Polytope
Sampling in Space Restricted Settings
Computing Shapley Value in Supermodular Coalitional Games
MPMD on Two Sources with Lookahead
Coordinate Assignment for Cyclic Level Graphs
A 2 k Kernel for the Cluster Editing Problem
An Innovative Irregular Nesting Algorithm for Flaw Avoidance
Geometric RAC Simultaneous Drawings of Graphs
Weak Mitoticity of Bounded Disjunctive and Conjunctive Truth-Table Autoreducible Sets
On Unfolding Lattice Polygons/Trees and Diameter-4 Trees
A Nearly-4log n Depth Lower Bound for Formulas With Restriction on Top
Reconstruction of Interval Graphs
On Some Optimization Problems in Obnoxious Facility Location
Optimal Window Queries on Line Segments Using the Trapezoidal Search DAG
On the Negation-Limited Circuit Complexity of Sorting and Inverting k -tonic Sequences
Hierarchies and Characterizations of Stateless Multicounter Machines
The Complexity of Mean Payoff Games
Logical Analysis of Data with Decomposable Structures
Efficient Construction of Low Weight Bounded Degree Planar Spanner
The Iterated Restricted Immediate Snapshot Model
DNA Complementarity and Paradigms of Computing
Task Scheduling in Multi-layer CLOS Topology Networks Based on Shortest Path
Colouring Graphs with No Induced Six-Vertex Path or Diamond
On the Advice Complexity of the Online L (2, 1)-Coloring Problem on Paths and Cycles
The Ultimate Strategy to Search on m Rays?
DVS Scheduling in a Line or a Star Network of Processors
Approximating Uniform Triangular Meshes in Polygons
Exploring Simple Grid Polygons
Average-Case Competitive Analyses for One-Way Trading
On Sparse Parity Chack Matrices (Extended Abstract)
Approximation Algorithms for Priority Steiner Tree Problems
Improved Parameterized Algorithms for Scheduling with Precedence Constraints and Time Windows
An Approximation Algorithm for the Two-Layered Graph Drawing Problem
The Violation Heap: A Relaxed Fibonacci-Like Heap
An FPTAS for Weight-Constrained Steiner Trees in Series-Parallel Graphs
Bounds for the Super Extra Edge Connectivity of Graphs
(1+rho)-Approximation for Selected-Internal Steiner Minimum Tree
Towards Flexible Demands in Online Leasing Problems
Reconfiguring Spanning and Induced Subgraphs
Bimodal Crossing Minimization
Design and Analysis of Parallel Set-Term Unification
Greedy Gray Codes for Dyck Words and Ballot Sequences
Approximating Continuous Multi-agent Contracts with Lyapunov Function Methods
Competitive Algorithms for Online Pricing
Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph
A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints
Normal Form Expressions of Propositional Projection Temporal Logic
Multi-pattern Matching with Bidirectional Indexes
GCD of Many Integers
A Local Algorithm for Finding Dense Bipartite-Like Subgraphs
Towards Optimal and Expressive Kernelization for d-Hitting Set
Computing a Maximum Clique in Geometric Superclasses of Disk Graphs
On the Connected Domination Number of Random Regular Graphs
Cograph Editing: Complexity and Parameterized Algorithms
Fault Hamiltonicity of Meshes with Two Wraparound Edges
Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free Words
Recent Results for Online Makespan Minimization
End-Vertices of AT-free Bigraphs
Two-Stage BP Maximization Under p-matroid Constraint
Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number
Distributed Computing in Asynchronous Networks with Byzantine Edges
On TC0 Lower Bounds for the Permanent
Reconstruction of Boolean Formulas in Conjunctive Normal Form
List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs
Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well
Exponential Time Complexity of the Complex Weighted Boolean #CSP
String Coding of Trees with Locality and Heritability
Succinct Monotone Circuit Certification: Planarity and Parameterized Complexity
Characterization of Level Non-planar Graphs by Minimal Patterns
Algorithms for Normal Curves and Surfaces
Parameterized Approximability of Maximizing the Spread of Influence in Networks
Pioneers of Influence Propagation in Social Networks
Optimal Algorithms for Finding Connected Components of an Unknown Graph
Computing and Combinatorics - 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part II
An Efficiently Recognisable Subset of Hypergraphic Sequences
A Compact Storage Scheme for Fast Wavelet-Based Subregion Retrieval
Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms
From Preemptive to Non-preemptive Scheduling Using Rejections
Property Testing for Cyclic Groups and Beyond
Between SC and LOGDCFL: Families of Languages Accepted by Polynomial-Time Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata
A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition
The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality
Deterministic Metric 1-median Selection with a 1-o(1) Fraction of Points Ignored
When Does Greedy Learning of Relevant Attributes Succeed?
Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width
Document Processing, Theory, and Practice (Abstract)
Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction
Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence
Complexity of Grundy Coloring and Its Variants
Rearrangeable Graphs
A Rigorous Analysis for Set-Up Time Models - A Metric Perspective
Transducers with Set Output
Bivariate Complexity Analysis of Almost Forest Deletion
Analysis of Approximate Sorting in I/O Model
Bounded-Degree Spanners in the Presence of Polygonal Obstacles
Depth-Efficient Threshold Circuits for Multiplication and Symmetric Function Computation
Diffuse Reflection Radius in a Simple Polygon
Conserved Interval Distance Computation Between Non-trivial Genomes
Parallel Truss Maintenance Algorithms for Dynamic Hypergraphs
Hypercontractivity via Tensor Calculus
Improved Deterministic Algorithms for Non-monotone Submodular Maximization
Conditionally Critical Indecomposable Graphs
Diversity and Freshness-Aware Regret Minimizing Set Queries
Regular Expressions for Languages over Infinite Alphabets
Reconfiguration of Maximum-Weight b-Matchings in a Graph
Partially Specified Nearest Neighbor Search
On the Hardness of Reachability Reduction
On the Readability of Monotone Boolean Formulae
Social Exchange Networks with Distant Bargaining
On Parameterized Enumeration
Strong Chromatic Index of Graphs with Small Girth
An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits
On Smoothed Analysis of Quicksort and Hoare's Find
Strong Triadic Closure in Cographs and Graphs of Low Maximum Degree
Improved Algorithms for Weighted and Unweighted Set Splitting Problems
A Two-Stage Flexible Flowshop Problem with Deterioration
Fast Range Searching with Delaunay Triangulations
Online Independent Sets
An Approximation Framework for Bounded Facility Location Problems
Progress on Maximum Weight Triangulation
Faster Generation of Shorthand Universal Cycles for Permutations
Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings
Optimization of Fresh E-Commerce Warehouse Layout Based on 0-1 Integer Programming 1
Fast Construction of Generalized Suffix Trees Over a Very Large Alphabet
Symmetric Norm Estimation and Regression on Sliding Windows
Eulerian Secret Key Exchange
Straight-Line Monotone Grid Drawings of Series-Parallel Graphs
Local Search Strikes Again: PTAS for Variants of Geometric Covering and Packing
Multirate Multicast Switching Networks
The Structure and Number of Global Roundings of a Graph
An Evolving Network Model from Clique Extension
Probe Ptolemaic Graphs
On Separating Proofs of Knowledge from Proofs of Membership of Languages and Its Application to Secure Identification Schemes (Extended Abstract)
Currying of Order-Sorted Term Rewriting Systems
New Bounds for the Balloon Popping Problem
Effincient Domination of Permutation Graphs and Trapezoid Graphs
Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect
Pandiagonal Magic Squares
Approximate Counting with a Floating-Point Counter
A New Model for Product Adoption over Social Networks
The Inherent Dimension of Bounded Counting Classes
Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth
Balanced Allocation on Graphs: A Random Walk Approach
Upper and Lower Bounds on Approximating Weighted Mixed Domination
A Note on Vertex Cover in Graphs with Maximum Degree 3
Approximation Algorithms for the Maximum Connected Submodular Functions
Lower Bounds for the Happy Coloring Problems
On Colorful Bin Packing Games
Resolution of Hartmanis' Conjecture for NL-Hard Sparse Sets
Simple Reduction of f-Colorings to Edge-Colorings
A Selected Tour of the Theory of Identification Matrices
Combiners for Chosen-Ciphertext Security
On Sorting by Unsigned Symmetric Reversals
Equivalence of Connected and Peak-Pit Maximal Condorcet Domains
Access Structure Hiding Secret Sharing from Novel Set Systems and Vector Families
Computing and Combinatorics, 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings
Construction of Scale-Free Networks with Partial Information
Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract)
Diagonalization Strikes Back: Some Recent Lower Bounds in Complexity Theory
Constructing Tri-CISTs in Shuffle-Cubes
Canonizing Hypergraphs under Abelian Group Action
A Branch-and-Bound Algorithm for Computing Node Weighted Steiner Minimum Trees
The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs
Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates
Chance-Constrained Submodular Knapsack Problem
Lower Bounds on the Minus Domination and k-Subdomination Numbers
Online Prediction Problems with Variation
Isoperimetric Problem and Meta-Fibonacci Sequences
Facility Location Games with Ordinal Preferences
Imbalance, Cutwidth, and the Structure of Optimal Orderings
VC Dimension Bounds for Analytic Algebraic Computations
On a Kind of Sequence of Polynomials
Quantum DNF Learnability Revisited
Inverse Parametric Sequence Alignment
Generating Combinations by Prefix Shifts
On the Monotonicity of Weak Searching
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks
Scheduling Task-Tree with Additive Scales on Parallel / Distributed Machines
Streaming Algorithm for Balance Gain and Cost with Cardinality Constraint on the Integer Lattice
Scheduling Broadcasts with Deadlines
Fixed Parameter Tractable Algorithms in Combinatorial Topology
On the Restricted 1-Steiner Tree Problem
Spin Systems on Graphs with Complex Edge Functions and Specified Degree Regularities
Inferring Evolutionary Trees with Strong Combinatorial Evidence
The Shapes of Trees
One-to-Many Disjoint Path Covers in a Graph with Faulty Elements
Small H -Coloring Problems for Bounded Degree Digraphs
Corrigendum: Exact Learning of Subclasses of CDNF Formulars with Membership Queries
Doubly Constrained Fair Clustering for General p-Norms
Sponsored Search Auction Design Beyond Single Utility Maximization
Scheduling Jobs on Heterogeneous Platforms
Optimal Multiresolution Polygonal Approximation
Streaming Algorithms Measured in Terms of the Computed Quantity
Parametric Power Supply Networks
The Coverage Problem by Aligned Disks
Rectangular Grid Drawings of Plane Graphs
3D Path Network Planning: Using a Global Optimization Heuristic for Mine Water-Inrush Evacuation
An Improved Algorithm for Online Unit Clustering
Fast and Dependable Communication in Hyper-rings
Construction of Binary Cooperative MSR Codes with Multiple Repair Degrees
Optimal Inspection Points for Malicious Attack Detection in Smart Grids
The Orbit Problem Is in the GapL Hierarchy
On the Complexity of Samples for Learning
A Lin-Kernighan Heuristic for the DCJ Median Problem of Genomes with Unequal Contents
Approximating Global Optimum for Probabilistic Truth Discovery
SHADE Algorithm Dynamic Analyzed Through Complex Network
Automorphisms of the Cube n^d
Convexity of Minimal Total Dominating Functions in Graphs
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
Area-Efficient Order-Preserving Planar Straight-Line Drawings of Ordered Trees
Ordinal On-Line Scheduling on Two Uniform Machines
Perturbation of the Hyper-Linked Environment
Minimum Back-Walk-Free Latency Problem
Liar's Dominating Set in Unit Disk Graphs
Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures Prediction
Embedding Three Edge-Disjoint Hamiltonian Cycles into Locally Twisted Cubes
Improved Approximation Algorithm and Hardness Result for Sorting Unsigned Strings by Symmetric Reversals
Exploiting the Robustness on Power-Law Networks
Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study
List Total Colorings of Series-Parallel Graphs
On the Planar Two-Watchtower Problem
Wormhole Versus Deflection Routing: A Case Study on the Mesh
Reconfiguration of Dominating Sets
Computing a Minimum-Width Square or Rectangular Annulus with Outliers - [Extended Abstract]
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
De-amortization of Algorithms
Adjacency of Optimal Regions for Huffman Trees
Iterated TGR Languages: Membership Problem and Effective Closure Properties
Group Mutual Exclusion Algorithms Based on Ticket Orders
Maximization of Constrained Non-submodular Functions
Optimal Labelling of Point Features in the Slider Model
Task Ordering and Memory Management Problem for Degree of Parallelism Estimation
Max-Min 3-Dispersion Problems
Most Pseudo-copy Languages Are Not Context-Free
Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems
Competitive Facility Location along a Highway
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
A Tighter Relation Between Sensitivity Complexity and Certificate Complexity
Delaying Decisions and Reservation Costs
Shortest Color-Spanning Intervals
Parameterized Algorithms for Planar 2-Layer Drawing by Vertex Splitting on a Given Subset
Rooting Gene Trees via Phylogenetic Networks
A New Pseudoknots Folding Algorithm for RNA Structure Prediction
Sublinear Algorithms for Scheduling with Chain Precedence Constraints
On the Selection and Assignment with Minimum Quantity Commitments
Construction Algorithm of Vertex-Disjoint Paths in Circulant-Based Recursive Networks
Hamiltonian Cycles in 2-generated Cayley Digraphs of Abelian Groups
Polynomial Time Algorithms for Three-Label Point Labeling
Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs
Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs
Facility Location Game for Maximizing the Social Satisfaction on a Line
On Center Regions and Balls Containing Many Points
Power of Decision Trees with Monotone Queries
Making Abstraction-Refinement Efficient in Model Checking
The Complexity of Word Circuits
ReachFewL = ReachUL
Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line
Discovering Pairwise Compatibility Graphs
Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application
Computing and Combinatorics - 31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 15-17, 2025, Proceedings, Part I
Distributed Dominating Sets in Interval Graphs
Building above Read-once Polynomials: Identity Testing and Hardness of Representation
Handling Big Data of Online Social Networks on a Small Machine
A Non-Extendibility Certificate for Submodularity and Applications
Evaluating Bayesian Networks via Data Streams
How Hard Is Completeness Reasoning for Conjunctive Queries?
The Full Steiner Tree Problem in Phylogeny
Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings
Approximation Algorithms for Cutting Out Polygons with Lines and Rays
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems
Constant Time Approximation Scheme for Largest Well Predicted Subset
K-Division Framework Enhances GNNs' Expressive Power
Improved Local Search for Universal Facility Location
Making Profit in a Prediction Market
A Little Aggression Goes a Long Way
A Dynamic-Programming Bound for the Quadratic Assignment Problem
Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete
Approximating the Maximum Weight Cycle/Path Partition in Graphs with Weights One and Two
Improved Separated Red-Blue Center Clustering
On the Smoothed Heights of Trie and Patricia Index Trees
Computing and Combinatorics, Second Annual International Conference, COCOON '96, Hong Kong, June 17-19, 1996, Proceedings
k-Median/Means with Outliers Revisited: A Simple Fpt Approximation
The Seeding Algorithm for Functional k-Means Problem
Improved Approximation for Time-Dependent Shortest Paths
A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation
Fault Diagnosability of Regular Networks Under the Hybrid PMC Model
A Rabin-Type Scheme Based on y 2 equiv x 3 + bx 2 mod n
Vertex-Critical (P 5,W 4) -Free Graphs
Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses
Some Observations on the Computational Complexity of Graph Accessibility Problem
Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM
Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem
Dynamic Tree Shortcut with Constant Degree
Computing and Combinatorics - 30th International Conference, COCOON 2024, Shanghai, China, August 23-25, 2024, Proceedings, Part I
The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points
Respecting Lower Bounds in Uniform Lower and Upper Bounded Facility Location Problem
Approximating Decision Trees with Priority Hypotheses
Improved On-Line Stream Merging: From a Restricted to a General Setting
Efficient Learning of Some Linear Matrix Languages
Algorithms for Terminal Steiner Trees
Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem
Back-Up 2-Center on a Path/Tree/Cycle/Unicycle
Hunting a Rabbit Is Hard
On the Probe Problem for (r, ℓ )-Well-Coveredness
Counting Minimum Weighted Dominating Sets
Approximating Alternative Solutions
Quantum Speedup for the Minimum Steiner Tree Problem
A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees
An Incentive Compatible, Efficient Market for Air Traffic Flow Management
On the Extensions of Solovay-Reducibility.
Improved Space Efficient Algorithms for BFS, DFS and Applications
An Exact Branch and Bound Algorithm for the Steiner Problem in Graphs
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
Quantum Algorithm for the Boolean Hidden Shift Problem
Structure in Approximation Classes (Extended Abstract)
Erdős-Szekeres Maker-Breaker Games
The k Edge-Vertex Domination Problem
Maximum Weight Triangulation and Its Application on Graph Drawing
Transformations for Maximal Planar Graphs with Minimum Degree Five
Covering Tree with Stars
Rotation Distance for Rank Bounded Trees
On Computation of Arbitrage for Markets with Friction
Min-Energy Voltage Allocation for Tree-Structured Tasks
Dynamic Programming for H-minor-free Graphs
Sampling from Dense Streams without Penalty - Improved Bounds for Frequency Moments and Heavy Hitters
Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs
A Physical Model for the Satisfiability Problem
Improved Sourcewise Roundtrip Spanners with Constant Stretch
Resource Bounded Frequency Computations with Three Errors
Counting d -Dimensional Polycubes and Nonrectangular Planar Polyominoes
Massively Parallel Approximate Steiner Tree Algorithms
The d -Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm
On Walrasian Price of CPU Time
A Highly Efficient Algorithm to Determine Bicritical Graphs
Near-Optimal Algorithm for Supporting Small and Medium-Sized Enterprises in Ad Systems
Optimal Algorithms for Circle Partitioning
Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph
Finding Frequent Items in a Turnstile Data Stream
Edge-Face Total Chromatic Number of Outerplanar Graphs with Delta(G)=6
Geometric Spanners in the MapReduce Model
Approximating Per-Scenario Bound for the Two-Stage Stochastic Facility Location Problem
A Time-Space Trade-Off for Triangulations of Points in the Plane
Scheduling over Scenarios on Two Machines
Stretch in Bottleneck Games
Terrain Polygon Decomposition, with Application to Layered Manufacturing
Depth Lower Bounds against Circuits with Sparse Orientation