The following pages link to Algorithms – ESA 2004 (Q5464611):
Displaying 38 items.
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings (Q266919) (← links)
- Fair matchings and related problems (Q270032) (← links)
- Minimum cost input/output design for large-scale linear structural systems (Q274009) (← links)
- Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets (Q297414) (← links)
- Succinct posets (Q329288) (← links)
- Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
- Minimum many-to-many matchings for computing the distance between two sequences (Q497361) (← links)
- Greedy matching: guarantees and limitations (Q513303) (← links)
- In-place algorithms for computing a largest clique in geometric intersection graphs (Q741534) (← links)
- Quantum algorithms for matching problems (Q839634) (← links)
- Multiconsistency and robustness with global constraints (Q857890) (← links)
- Alternating paths along axis-parallel segments (Q882782) (← links)
- Mantaining dynamic matrices for fully dynamic transitive closure (Q930605) (← links)
- An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion (Q1759683) (← links)
- Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation (Q1950387) (← links)
- Independent sets and hitting sets of bicolored rectangular families (Q2032357) (← links)
- Going beyond dual execution: MPC for functions with efficient verification (Q2055697) (← links)
- Output sensitive fault tolerant maximum matching (Q2097219) (← links)
- Maximum 0-1 timed matching on temporal graphs (Q2161255) (← links)
- The power of linear-time data reduction for maximum matching (Q2211355) (← links)
- Recomputing causality assignments on lumped process models when adding new simplification assumptions (Q2331813) (← links)
- Maximum matchings in planar graphs via Gaussian elimination (Q2369872) (← links)
- On computing an optimal semi-matching (Q2408093) (← links)
- Edge-stable equimatchable graphs (Q2414461) (← links)
- Bipartite matching in the semi-streaming model (Q2429353) (← links)
- On finding a large number of 3D points with a small diameter (Q2457016) (← links)
- Processor efficient parallel matching (Q2471700) (← links)
- Algebraic Algorithms for Linear Matroid Parity Problems (Q2799476) (← links)
- Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings (Q2915140) (← links)
- Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems (Q2971609) (← links)
- Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation (Q3009769) (← links)
- Jump Number of Two-Directional Orthogonal Ray Graphs (Q3009778) (← links)
- On Computing an Optimal Semi-matching (Q3104781) (← links)
- (Q4638113) (← links)
- (Q5088980) (← links)
- The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)
- Maximum matchings in geometric intersection graphs (Q6050213) (← links)
- Diverse Pairs of Matchings (Q6065425) (← links)
