yusuke1997/dblp-id-title huggingface dataset:
Numerical Estimation of the Impact of Interferences on the Localization Problem in Sensor Networks
Approximation Algorithms for 1-Wasserstein Distance Between Persistence Diagrams
Explanations for the Cumulative Constraint: An Experimental Study
Workload Balancing in Multi-stage Production Processes
On the Separation of Topology-Free Rank Inequalities for the Max Stable Set Problem
A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling
Mixed-Integer Optimization for Loopless Flux Distributions in Metabolic Networks
Reoptimization in Branch-and-Bound Algorithms with an Application to Elevator Control
Improving Linear Programming Approaches for the Steiner Tree Problem
Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems
A Fast Data Structure for Dynamic Graphs Based on Hash-Indexed Adjacency Blocks
Consumption Profiles in Route Planning for Electric Vehicles: Theory and Applications
Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs
Scalable Hard Instances for Independent Set Reconfiguration
How to Splay for loglog N-Competitiveness
A Metaheuristic for a Two Echelon Location-Routing Problem
Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
Personal Routes with High-Dimensional Costs and Dynamic Approximation Guarantees
SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks
Optimal Edge Deletions for Signed Graph Balancing
Efficient Representation for Online Suffix Tree Construction
Algorithms for Gradual Polyline Simplification
Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods
Faster Adaptive Set Intersections for Text Searching
A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs
Fast and Scalable Minimal Perfect Hashing for Massive Key Sets
An Empirical Study of Online Packet Scheduling Algorithms
Engineering an Approximation Scheme for Traveling Salesman in Planar Graphs
Faster Treewidth-Based Approximations for Wiener Index
Bidirectional A * Search for Time-Dependent Fast Paths
Engineering Parallel In-Place Random Generation of Integer Permutations
An Evaluation of Dynamic Labeling Schemes for Tree Networks
Practical Partitioning-Based Methods for the Steiner Problem
Extending Search Phases in the Micali-Vazirani Algorithm
Discrete Hyperbolic Random Graph Model
Experimental Evaluation of Algorithms for the Orthogonal Milling Problem with Turn Costs
Sparsity-Driven Aggregation of Mixed Integer Programs
On an Experimental Algorithm for Revenue Management for Cargo Airlines
Scheduling Additional Trains on Dense Corridors
Novel Techniques for Automorphism Group Computation
Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams
Experimental Study of Compressed Stack Algorithms in Limited Memory Environments
Quadratic Outer Approximation for Convex Integer Programming with Box Constraints
An Analysis of Heuristics for Vertex Colouring
A Comparative Study of Compressed, Learned, and Traditional Indexing Methods for Integer Data
Graph Partitioning with Acyclicity Constraints
Compressed Dictionaries: Space Measures, Data Sets, and Experiments
Efficient Implementation of Rank and Select Functions for Succinct Representation
Engineering Graph Partitioning Algorithms
Probing a Set of Trajectories to Maximize Captured Information
High-Quality Hierarchical Process Mapping
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study
Benchmarks for Strictly Fundamental Cycle Bases
Empirical Investigation of Simplified Step-Size Control in Metaheuristics with a View to Theory
An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
A Bulk-Parallel Priority Queue in External Memory with STXXL
Crossing Minimization in Weighted Bipartite Graphs
Greedily Improving Our Own Centrality in A Network
Comparing Push- and Pull-Based Broadcasting
An Edge Quadtree for External Memory
Order-Preserving Matching with Filtration
An Algorithm to Identify Clusters of Solutions in Multimodal Optimisation
Exact Algorithms for Cluster Editing: Evaluation and Experiments
Algorithms and Experiments on Colouring Squares of Planar Graphs
Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences
Feasibility Pump Heuristics for Column Generation Approaches
An Efficient Implementation of a Joint Generation Algorithm
On the Generation of Cutting Planes which Maximize the Bound Improvement
Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games
Customizable Route Planning
Fast Spherical Drawing of Triangulations: An Experimental Study of Graph Drawing Tools
Analysis and Visualization of Social Networks
Online Construction of Wavelet Trees
Efficient Minimum Weight Vertex Cover Heuristics Using Graph Neural Networks
Selecting the Roots of a Small System of Polynomial Equations by Tolerance Based Matching
Fast and Robust Vectorized In-Place Sorting of Primitive Types
Faster Betweenness Centrality Updates in Evolving Networks
Simple Runs-Bounded FM-Index Designs Are Fast
Engineering the Modulo Network Simplex Heuristic for the Periodic Timetabling Problem
Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation
A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets
Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem
Experimental Algorithms, 12th International Symposium, SEA 2013, Rome, Italy, June 5-7, 2013. Proceedings
Engineering a Compressed Suffix Tree Implementation
An Adaptive Refinement Algorithm for Discretizations of Nonconvex QCQP
Inferring AS Relationships: Dead End or Lively Beginning?
UKP5: A New Algorithm for the Unbounded Knapsack Problem
A Simple Randomized k-Local Election Algorithm for Local Computations
Storing Set Families More Compactly with Top ZDDs
Local Clustering of Large Graphs by Approximate Fiedler Vectors
Three Is Enough for Steiner Trees
Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity
Exact Bipartite Crossing Minimization under Tree Constraints
A Branch-Cut-and-Price Algorithm for the Capacitated Arc Routing Problem
Multi-level Algorithms for Modularity Clustering
Jdrasil: A Modular Library for Computing Tree Decompositions
Combinatorial Optimization for Weighing Matrices with the Ordering Messy Genetic Algorithm
Fleet Management for Autonomous Vehicles Using Multicommodity Coupled Flows in Time-Expanded Networks
Engineering a New Loop-Free Shortest Paths Routing Algorithm
Separable Non-convex Underestimators for Binary Quadratic Programming
Rectangle Covers Revisited Computationally
Engineering Color Barcode Algorithms for Mobile Applications
A Decomposition Approach for Solving Critical Clique Detection Problems
Increased Bit-Parallelism for Approximate String Matching
Tiny Experiments for Algorithms and Life
Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth
Efficient Algorithms for k-Regret Minimizing Sets
Stochastic Route Planning for Electric Vehicles
Policy-Based Benchmarking of Weak Heaps and Their Relatives,
Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays
Erratum: Customizable Contraction Hierarchies
Exact Lower Bounds for the Number of Comparisons in Selection
Faster Customization of Road Networks
Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications
Efficient Traffic Assignment for Public Transit Networks
Design of Practical Succinct Data Structures for Large Data Collections
Generating and Radiocoloring Families of Perfect Graphs
Transit Node Routing Reconsidered
23rd International Symposium on Experimental Algorithms, SEA 2025, Venice, Italy, July 22-24, 2025
A Lazy Version of Eppstein's K Shortest Paths Algorithm
Candidate Sets for Alternative Routes in Road Networks
Parallel Five-Cycle Counting Algorithms
BDDs in a Branch and Cut Framework
Parallel Smith-Waterman Algorithm for Local DNA Comparison in a Cluster of Workstations
Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results
The Quantile Index - Succinct Self-Index for Top-k Document Retrieval
Algorithms and Linear Programming Relaxations for Scheduling Unrelated Parallel Machines
Degree-Based Treewidth Lower Bounds
A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
A Merging Heuristic for the Rectangle Decomposition of Binary Matrices
Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications
IBB: Fast Burrows-Wheeler Transform Construction for Length-Diverse DNA Data
Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem
Separation of Generic Cutting Planes in Branch-and-Price Using a Basis
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
21st International Symposium on Experimental Algorithms, SEA 2023, Barcelona, Spain, July 24-26, 2023
The Isomap Algorithm in Distance Geometry
Bit Packed Encodings for Grammar-Compressed Strings Supporting Fast Random Access
Pareto Paths with SHARC
A Maximum Profit Coverage Algorithm with Application to Small Molecules Cluster Identification
Engineering Predecessor Data Structures for Dynamic Integer Sets
Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
Implementing Minimum Cycle Basis Algorithms
Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems
Station Assignment with Reallocation
The Hub Labeling Algorithm
Decision Diagrams for Solving a Job Scheduling Problem Under Precedence Constraints
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Combining Speed-Up Techniques for Shortest-Path Computations
A Label Correcting Algorithm for the Shortest Path Problem on a Multi-modal Route Network
An Efficient Algorithm for alpha-Approximate Matching with delta -Bounded Gaps in Musical Sequences
Engineering the LOUDS Succinct Tree Representation
Hypergraph Transversal Computation with Binary Decision Diagrams
Exact and Approximate Range Mode Query Data Structures in Practice
A Column Generation Approach to Scheduling of Periodic Tasks
Determining Fixed-Length Paths in Directed and Undirected Edge-Weighted Graphs
Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs
Dynamic Highway-Node Routing
Automatic Reformulations for Convex Mixed-Integer Nonlinear Optimization: Perspective and Separability
Speeding up Dualization in the Fredman-Khachiyan Algorithm B
An Analytical Model for Energy Minimization
Computing Branch Decomposition of Large Planar Graphs
Continuous Local Strategies for Robotic Formation Problems
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments
Matching in Bipartite Graph Streams in a Small Number of Passes
Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching
Scheduling Unrelated Parallel Machines Computational Results
Accelerating Vickrey Payment Computation in Combinatorial Auctions for an Airline Alliance
Computational Aspects of Ordered Integer Partition with Upper Bounds
Aggregative Coarsening for Multilevel Hypergraph Partitioning
Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors
Efficient Implementations of Heuristics for Routing and Wavelength Assignment
Geometric Minimum Spanning Trees with GeoFilterKruskal
Concurrent Iterated Local Search for the Maximum Weight Independent Set Problem
Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games
Engineering Exact Quasi-Threshold Editing
Fréchet Mean and p-Mean on the Unit Circle: Decidability, Algorithm, and Applications to Clustering on the Flat Torus
Experimental Results for Stackelberg Scheduling Strategies
Path Query Data Structures in Practice
... The Interaction Between Algorithms and Game Theory
From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering
An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem
An Empirical Study for Inversions-Sensitive Sorting Algorithms
A Greedy Approximation Algorithm for the Uniform Labeling Problem Analyzed by a Primal-Dual Technique
Multilinear Formulations for Computing a Nash Equilibrium of Multi-Player Games
A Branch-And-Bound Algorithm for Cluster Editing
Reoptimization Techniques for MIP Solvers
How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas
How to Attack the NP-Complete Dag Realization Problem in Practice
Lempel-Ziv Decoding in External Memory
Experimental Evaluations of Algorithms for IP Table Minimization
GRASP with Path-Relinking for Data Clustering: A Case Study for Biological Data
Dictionary Matching in Elastic-Degenerate Texts with Applications in Searching VCF Files On-line
Telling Stories Fast
Computing Multiple Watchman Routes
Subset Wavelet Trees
Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover
An Algorithm for the Exact Treedepth Problem
On the Solution of Circulant Weighing Matrices Problems Using Algorithm Portfolios on Multi-core Processors
A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy Nodes
Online Knapsack of Unknown Capacity: - Energy Optimization for Smartphone Communications
Minimum Scan Cover and Variants - Theory and Experiments
A Heuristic for Non-convex Variance-Based Clustering Criteria
Digraph k-Coloring Games: From Theory to Practice
Hub Label Compression
ILP-based Local Search for Graph Partitioning
Experimental Evaluation of Parametric Max-Flow Algorithms
Evaluation of Basic Protocols for Optical Smart Dust Networks
Tractable Pathfinding for the Stochastic On-Time Arrival Problem
Using Random Sampling to Build Approximate Tries for Efficient String Sorting
A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions
Selecting Data for Experiments: Past, Present and Future
Taxonomic Classification with Maximal Exact Matches in KATKA Kernels and Minimizer Digests
The Role of Experimental Algorithms in Genomics
Routing in Multimodal Transportation Networks with Non-Scheduled Lines
Contraction of Timetable Networks with Realistic Transfers
Space-Efficient SHARC-Routing
Algorithm Engineering for Optimal Graph Bipartization
Huffman Codes versus Augmented Non-Prefix-Free Codes
Acceleration of Shortest Path and Constrained Shortest Path Computation
An Experimental Evaluation of Treewidth at Most Four Reductions
Fast Algorithm for Graph Isomorphism Testing
CHICO: A Compressed Hybrid Index for Repetitive Collections
Advanced Multilevel Node Separator Algorithms
Think Locally, Act Globally: Highly Balanced Graph Partitioning
An Incremental Model for Combinatorial Maximization Problems
Faster Multi-Modal Route Planning With Bike Sharing Using ULTRA
Top- k Frequent Patterns in Streams and Parameterized-Space LZ Compression
On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space
An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem
Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks
Distributed Domain Propagation
Indexing Compressed Text: A Tale of Time and Space (Invited Talk)
Algorithms for New Types of Fair Stable Matchings
Practical Computation of Graph VC-Dimension
Experimental Analysis of LP Scaling Methods Based on Circuit Imbalance Minimization
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
Lists Revisited: Cache Conscious STL Lists
Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm
Experimental Study of Resilient Algorithms and Data Structures
New Bit-Parallel Indel-Distance Algorithm
Algorithm Engineering for High-Dimensional Similarity Search Problems (Invited Talk)
An Efficient Heuristic for the Ring Star Problem
Algorithms for Subnetwork Mining in Heterogeneous Networks
Hierarchical Relative Lempel-Ziv Compression
An Alternative Ranking Problem for Search Engines
An Experimental Analysis of a Polynomial Compression for the Steiner Cycle Problem
18th International Symposium on Experimental Algorithms, SEA 2020, Catania, Italy, June 16-18, 2020
Univariate Algebraic Kernel and Application to Arrangements
Experimental Algorithms - 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings
Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes
Multi-Level Steiner Trees
A New Class of Greedy Heuristics for Job Shop Scheduling Problems
Elias-Fano Compression for Space-Efficient Rank and Select Structures
The "Real" Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting
Fingered Multidimensional Search Trees
Engineering a Preprocessor for Symmetry Detection
Search Data Structures for Skewed Strings
Compressed String Dictionaries
Lightweight Lempel-Ziv Parsing
Proxying Betweenness Centrality Rankings in Temporal Networks
17th International Symposium on Experimental Algorithms, SEA 2018, L'Aquila, Italy, June 27-29, 2018
Realtime Classification for Encrypted Traffic
Efficient Yao Graph Construction
Lempel, Even, and Cederbaum Planarity Method
Distributed Time-Dependent Contraction Hierarchies
Customizable Contraction Hierarchies
Space and Time Trade-Off for the k Shortest Simple Paths Problem
On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations
An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization
An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number
Generating Time Dependencies in Road Networks
How to Find the Exit from a 3-Dimensional Maze
Using Compact Tries for Cache-Efficient Sorting of Integers
Public Transit Labeling
Maximum Coverage in Sublinear Space, Faster
Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket
Accelerating ILP Solvers for Minimum Flow Decompositions Through Search Space and Dimensionality Reductions
Convexity and Optimization of Condense Discrete Functions
Graph Partitioning for Independent Sets
A Fast and Tight Heuristic for A* in Road Networks
Efficient Computation of Topological Integral Transforms
Bit-Parallel Search Algorithms for Long Patterns
Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem
On the Least Cost for Proximity Searching in Metric Spaces
Loop Nesting Forests, Dominators, and Applications
Integrating Coordinated Checkpointing and Recovery Mechanisms into DSM Synchronization Barriers
Branch Mispredictions Don't Affect Mergesort
Algorithmic Techniques for Memory Energy Reduction
A Statistical Approach for Algorithm Selection
Experimental Algorithms - 10th International Symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proceedings
Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem
Local Search k-means++ with Foresight
Dynamic Arc-Flags in Road Networks
Exact Algorithms for the Matrix Bid Auction
Undercover Branching
Engineering Weighted Connectivity Augmentation Algorithms
Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings
Simple Compression Code Supporting Random Access and Fast String Matching
GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem
A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem
A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems
Vertex Cover Approximations: Experiments and Observations
Reconstructing Phylogenetic Networks with One Recombination
Efficient Routing in Road Networks with Turn Costs
Alternative Routes in Road Networks
Simple Space-Time Trade-Offs for AESA
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Synchronization Fault Cryptanalysis for Breaking A5/1
Practical Compressed Document Retrieval
Broadword Implementation of Rank/Select Queries
Comparing Integer Data Structures for 32 and 64 Bit Keys
Fast and Stable Repartitioning of Road Networks
Efficient Bit-Parallel Algorithms for ( delta , alpha )-Matching
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments
An Experimental Study of Algorithms for Packing Arborescences
Engineering Zuffix Arrays
Lists on Lists: A Framework for Self-organizing Lists in Environments with Locality of Reference
Almost FPRAS for Lattice Models of Protein Folding
Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP
Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs
Practical lower and upper bounds for the Shortest Linear Superstring
Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams
Multilevel Hypergraph Partitioning with Vertex Weights Revisited
Space Efficient Modifications to Structator - A Fast Index-Based Search Tool for RNA Sequence-Structure Patterns
Experimental Analysis of Algorithms for Coflow Scheduling
Experimental Algorithms - 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings
GreedyML: A Parallel Algorithm for Maximizing Constrained Submodular Functions
Using an Adaptive Memory Strategy to Improve a Multistart Heuristic for Sequencing by Hybridization
Streaming Matching and Edge Cover in Practice
Speed Dating - An Algorithmic Case Study Involving Matching and Scheduling
Engineering Algorithms for Approximate Weighted Matching
On Computing the Diameter of Real-World Directed (Weighted) Graphs
Isomorphism Test for Digraphs with Weighted Edges
Partitioning Complex Networks via Size-Constrained Clustering
New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
Designing Difficult Office Space Allocation Problem Instances with Mathematical Programming
A Huffman-Based Error Detecting Code
Bilevel Programming Approaches to the Computation of Optimistic and Pessimistic Single-Leader-Multi-Follower Equilibria
Tree Compression with Top Trees Revisited
Practical Variable Length Gap Pattern Matching
Computing Maximal Unique Matches with the r-Index
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
Approximation Algorithm for Chromatic Index and Edge-Coloring of Multigraphs
Improved Automated Reaction Mapping
Gateway Decompositions for Constrained Reachability Problems
Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning Forest
Partitioning the Bags of a Tree Decomposition into Cliques
On Balanced Separators in Road Networks
Algorithm Engineering of SSSP with Negative Edge Weights
From Static Code Distribution to More Shrinkage for the Multiterminal Cut
Experimental Algorithms, 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings
Algorithm Engineering for Sorting and Searching, and All That (Invited Talk)
Efficient Exact Online String Matching Through Linked Weak Factors
An Efficient Tabu Search Heuristic for the School Timetabling Problem
The Impact of Landscape Sparsification on Modelling and Analysis of the Invasion Process
A Practical Algorithm for 2-Admissibility
An Exact Algorithm for Diameters of Large Real Directed Graphs
Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set
Hub Labels: Theory and Practice
Parallel Partition Revisited
Developing Novel Statistical Bandwidths for Communication Networks with Incomplete Information
Algorithm Engineering for All-Pairs Suffix-Prefix Matching
Measuring the Similarity of Geometric Graphs
Multi-Level Weighted Additive Spanners
A Practical Minimal Perfect Hashing Method
New Results about Multi-band Uncertainty in Robust Optimization
Crystal Structure Prediction via Oblivious Local Search
Optimal University Course Timetables and the Partial Transversal Polytope
Engineering Efficient Paging Algorithms
Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study