An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

DOI10.1137/0202019zbMath0266.05114OpenAlexW2157529519WikidataQ55891586 ScholiaQ55891586MaRDI QIDQ5682014

Publication date: 1973

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0202019

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

Matchings in colored bipartite networks, A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing, Orthogonal layout with optimal face complexity, Scaling algorithms for network problems, Constraint programming and operations research, Periodic assignment and graph colouring, Optimizing the controllability of arbitrary networks with genetic algorithm, Characterizing the topological and controllability features of U.S. power transmission networks, Maximizing the number of unused colors in the vertex coloring problem, On gallery watchmen in grids, A $(3+\epsilon)k$-vertex kernel for edge-disjoint triangle packing, Finding maximum matching for bipartite graphs in parallel, Clique covering and clique partition in generalizations of line graphs, An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs, Bipartite permutation graphs, Recursive structure of S-matrices and an $O(m^ 2)$ algorithm for recognizing sign solvability, Tiling figures of the plane with two bars, The monotone circuit complexity of Boolean functions, Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits, On a scheduling problem where a job can be executed only by a limited number of processors, The general maximum matching algorithm of Micali and Vazirani, The stochastic stability of decentralized matching on a graph, A polynomial-time algorithm for reducing the number of variables in MAX SAT problem, Solution methods and computational investigations for the linear bottleneck assignment problem, Efficient subgraph matching using topological node feature constraints, A fast scaling algorithm for the weighted triangle-free 2-matching problem, The discrete time-cost tradeoff problem revisited, Activity nets: A guided tour through some recent developments, Gross substitutability: an algorithmic survey, Systems of distinct representatives for k families of sets, Maximum tree-packing in time $O(n^{5/2})$, Triangulating multitolerance graphs, Degree switching operations in networks and large scale systems assignment problems, Polynomial time algorithms for variants of graph matching on partial $k$-trees, Scalar aggregation in inconsistent databases., Small maximal matchings in random graphs., Minimum-cost flows in unit-capacity networks, Maximum matchings and trees, Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems, On generalized matching problems, Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication, Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs, Flow shop scheduling problem with conflict graphs, Graphs vertex-partitionable into strong cliques, On the parameterized complexity of $(k,s)$-SAT, The complexity of testing whether a graph is a superconcentrator, On the complexity of graph tree partition problems., An algorithm for matrix symmetrization, The complexity of computing metric distances between partitions, Depth-first search and the vertex cover problem, Network alignment by discrete Ollivier-Ricci flow, Algorithms and bounds for drawing directed graphs, A marriage matching mechanism menagerie, The isomorphism problem for classes of graphs closed under contraction, The translation square map and approximate congruence, Mathematical models for stable matching problems with ties and incomplete lists, A parameterized algorithmics framework for degree sequence completion problems in directed graphs, Parameterized algorithms and kernels for rainbow matching, Forests, frames, and games: Algorithms for matroid sums and applications, On extensions of the deterministic online model for bipartite matching and max-sat, New scaling algorithms for the assignment and minimum mean cycle problems, Branch-and-bound algorithms for the multi-product assembly line balancing problem, Matching theory -- a sampler: From Dénes König to the present, Minimum perfect bipartite matchings and spanning trees under categorization, On the complexity of finding iso- and other morphisms for partial $k$- trees, Finding a maximum matching in a circular-arc graph, Geometric stable roommates, A note on degree-constrained star subgraphs of bipartite graphs, A new fast heuristic for labeling points, Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs, A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph, AllDifferent-based filtering for subgraph isomorphism, Two-factors in orientated graphs with forbidden transitions, A remark on the time complexity of the subtree problem, Approximating largest convex hulls for imprecise points, The stable marriage problem with master preference lists, Representing triangulated graphs in stars, Approximating matchings in parallel, Stabilizing maximum matching in bipartite networks, On the $k$-orientability of random graphs, An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors, List edge multicoloring in graphs with few cycles, On the use of the complexity index as a measure of complexity in activity networks, Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems, Non-cancellative Boolean circuits: A generalization of monotone boolean circuits, Approximating the permanent via importance sampling with application to the dimer covering problem, Optimal movement of mobile sensors for barrier coverage of a planar region, Efficient bounds for the stable set, vertex cover and set packing problems, Detection of structural inconsistency in systems of equations with degrees of freedom and its applications, Depth-first search is inherently sequential, Sensitivity analysis of an agricultural linear programming model, A linear algorithm for perfect matching in hexagonal systems, Concerning the achromatic number of graphs, Network flow and 2-satisfiability, On the complexity of a family of generalized matching problems, Computing Euclidean bottleneck matchings in higher dimensions, Lower bounds on monotone complexity of the logical permanent, Concurrent operations can be parallelized in scheduling multiprocessor job shop, A theory of alternating paths and blossoms for proving correctness of the $O(\sqrt{V}E)$ general graph maximum matching algorithm, Finding all the perfect matchings in bipartite graphs, Optimum matchings in weighted bipartite graphs, Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings, Looking at the stars, Fair matchings and related problems, Optimum distance flag codes from spreads via perfect matchings in graphs, A $(2 + \epsilon ) k$-vertex kernel for the dual coloring problem, Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem, Distinguishing and classifying from $n$-ary properties, A polynomial algorithm for the extendability problem in bipartite graphs, A polynomial time solvable instance of the feasible minimum cover problem, An O$(n^{1.75})$ algorithm for $L(2,1)$-labeling of trees, A $\frac{9}{7}$-approximation algorithm for graphic TSP in cubic bipartite graphs, Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph, Quantum algorithms for matching problems, Parameterized tractability of the maximum-duo preservation string mapping problem, A note on the complexity of the causal ordering problem, Fast domino tileability, An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs, Enhancing complex network controllability by minimum link direction reversal, Masking traveling beams: optical solutions for NP-complete problems, trading space for time, Structural identifiability in low-rank matrix factorization, A parameterized perspective on packing paths of length two, An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms, Multiconsistency and robustness with global constraints, On size reduction techniques for multitape automata, Incremental assignment problem, Domino tilings and related models: Space of configurations of domains with holes, The complexity of computing the permanent, Solving subgraph isomorphism problems with constraint programming, Alternating paths along axis-parallel segments, Convex transversals, On testing monomials in multivariate polynomials, On vertex independence number of uniform hypergraphs, Matchability and $k$-maximal matchings, The single-input minimal controllability problem for structured systems, Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover, Distance three labelings of trees, Covering directed graphs by in-trees, Structural control of single-input rank one bilinear systems, Finding all maximally-matchable edges in a bipartite graph, Optimizing restriction site placement for synthetic genomes, The class cover problem with boxes, Noisy colored point set matching, Bottleneck partial-matching Voronoi diagrams and applications, Scheduling jobs with equal processing times subject to machine eligibility constraints, Communication and energy efficient routing protocols for single-hop radio networks, A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle, An efficient distributed algorithm for maximum matching in general graphs, Efficient simulation of circuits by EREW PRAMs, On the asymptotic optimality of an algorithm for solving the maximum $m$-PSP in a multidimensional Euclidean space, A simple reduction from maximum weight matching to maximum cardinality matching, A theory of rectangular dual graphs, Solving linear programs from sign patterns, Implicit computation of maximum bipartite matchings by sublinear functional operations, A fixed-parameter algorithm for the vertex cover $P_3$ problem, Solving the car sequencing problem via branch \& bound, Authentication codes and bipartite graphs, Dulmage-Mendelsohn canonical decomposition as a generic pruning technique, Weighted matching as a generic pruning technique applied to optimization constraints, Iterative improvement of vertex covers, Complexities of efficient solutions of rectilinear polygon cover problems, Vulnerability and controllability of networks of networks, Greed is good: Approximating independent sets in sparse and bounded-degree graphs, On complexity of special maximum matchings constructing, Reliable assignments of processors to tasks and factoring on matroids, Local computation algorithms for graphs of non-constant degrees, Approximating the tree and tour covers of a graph, Iterated local search with Trellis-neighborhood for the partial Latin square extension problem, Level scheduling under limited resequencing flexibility, Selected topics on assignment problems, Path factors and parallel knock-out schemes of almost claw-free graphs, Maximum bipartite flow in networks with adaptive channel width, The extended global cardinality constraint: an empirical survey, On distance constrained labeling of disk graphs, Approximate string matching with stuck address bits, The directed Hausdorff distance between imprecise point sets, On protein structure alignment under distance constraint, Parallel algorithms for bipartite matching problems on distributed memory computers, A self-stabilizing $\frac23$-approximation algorithm for the maximum matching problem, A combinatorial study of the rigidity of planar structures, Computing simple circuits from a set of line segments, Cliques in hyperbolic random graphs, Enhancing multi-document summarization using concepts, Counting houses of Pareto optimal matchings in the house allocation problem, Algorithms for unipolar and generalized split graphs, Computing a maximum cardinality matching in a bipartite graph in time $O(n^{1,5}\sqrt{m/\log \,n})$, Making sparse matrices sparser: Computational results, A simple existence criterion for $(g<f)$-factors, A perfect matching algorithm for sparse bipartite graphs, Balanced optimization problems, Approximating edge dominating set in dense graphs, Embedding partial Steiner triple systems is NP-complete, Recent trends in combinatorial optimization, Jump number of dags having Dilworth number 2, The complexity of completing partial Latin squares, Signsolvability revisited, Deadlock-freedom in resource contentions, On the computational complexity of qualitative coalitional games, An efficient bounds consistency algorithm for the global cardinality constraint, A fast algorithm to construct a representation for transversal matroids, Choosing $k$ from $m$: feasible elimination procedures reconsidered, On the parametric complexity of schedules to minimize tardy tasks., Approximation algorithms for Max Morse matching, Tight bounds on maximal and maximum matchings, A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness, Complexity of learning in concept lattices from positive and negative examples, Finding a complete matching with the maximum product on weighted bipartite graphs, It is tough to be a plumber, Approximate constrained bipartite edge coloring, Distributed scheduling for disconnected cooperation, A linear time algorithm for $L(2,1)$-labeling of trees, Minimal rationalizations, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, Iteratively reweighted least squares and slime mold dynamics: connection and convergence, Isomorphic tree spanner problems, On some algorithmic investigations of star partitions of graphs, Uniform-scale assessment of role minimization in bipartite networks and its application to access control, Finding a maximum matching in a permutation graph, Generalised arc consistency for the AllDifferent constraint: an empirical survey, A fixed-parameter tractable algorithm for matrix domination, A simpler linear time $ \frac{2}{3} - \varepsilon$ approximation for maximum weight matching, What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs, Finding minimum clique capacity, On graphs whose eternal vertex cover number and vertex cover number coincide, Allowing cycles in discrete Morse theory, Toughness, hamiltonicity and split graphs, Faster algorithm for finding maximum 1-restricted simple 2-matchings, Restrictions and preassignments in preemptive open shop scheduling, Chromatic index of dense quasirandom graphs, Algorithms for dense graphs and networks on the random access computer, List-coloring -- parameterizing from triviality, On the fixed controllable subspace in linear structured systems, On strongly connected digraphs with bounded cycle length, New characterisations of tree-based networks and proximity measures, Sorting with forbidden intermediates, Recovery of disrupted airline operations using $k$-maximum matching in graphs, Probabilistic quality estimations for combinatorial optimization problems, Maximum matching width: new characterizations and a fast algorithm for dominating set, Edge-stable equimatchable graphs, Improved algorithms for even factors and square-free simple $b$-matchings, On applications of bipartite graph associated with algebraic structures, The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs, On the tractability of optimization problems on $H$-graphs, Maximizing the strong triadic closure in split graphs and proper interval graphs, Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem, On the Grundy and $b$-chromatic numbers of a graph, Maximum matching in regular and almost regular graphs, The power of linear-time data reduction for maximum matching, Learning block-preserving graph patterns and its application to data mining, Housing markets through graphs, Optimal transmission schedules for lightwave networks embedded with de Bruijn graphs, On $(k+1)$-line graphs of $k$-trees and their nullities, Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search, Maximum packing for $k$-connected partial $k$-trees in polynomial time, The envy-free matching problem with pairwise preferences, The $b$-\textsc{Matching} problem in distance-hereditary graphs and beyond, Distributed backup placement in networks, Decomposition of university course timetabling. A systematic study of subproblems and their complexities, Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs, A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics, Strong structural input and state observability of linear time-invariant systems: graphical conditions and algorithms, Design of a crossbar VOQ real-time switch with clock-driven scheduling for a guaranteed delay bound, Closing complexity gaps for coloring problems on $H$-free graphs, On the complexity of connectivity in cognitive radio networks through spectrum assignment, $b$-coloring of tight graphs, An approximation of the minimum vertex cover in a graph, Iterative compression and exact algorithms, Solving Kirkman's schoolgirl problem in a few seconds, The geometry of partial fitness orders and an efficient method for detecting genetic interactions, Contraction and deletion blockers for perfect graphs and $H$-free graphs, Best of two local models: centralized local and distributed local algorithms, Block-based minimum input design for the structural controllability of complex networks, Independent sets and hitting sets of bicolored rectangular families, On the solution bound of two-sided scaffold filling, Approximating the smallest 2-vertex connected spanning subgraph of a directed graph, On improving matchings in trees, via bounded-length augmentations, School choice: Nash implementation of stable matchings through rank-priority mechanisms, Special parity of perfect matchings in bipartite graphs, An improved approximation for maximum $k$-dependent set on bipartite graphs, Triangulations intersect nicely, Stable matchings with covering constraints: a complete computational trichotomy, A faster algorithm for cuckoo insertion and bipartite matching in large graphs, Graph-theoretical approach to qualitative solvability of linear systems, Recomputing causality assignments on lumped process models when adding new simplification assumptions, Finding all common bases in two matroids, An algorithm for fractional assignment problems, Output sensitive fault tolerant maximum matching, Measurable equidecompositions for group actions with an expansion property, Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference., Computation of approximate polynomial GCDs and an extension, Efficient and flexible matching of recursive types, Computing valuations of the Dieudonné determinants, On sparsification for computing treewidth, Feedback control for structured descriptor systems with minimum free-entry pattern gain vectors, Modifying a graph using vertex elimination, Linear-time parameterized algorithms with limited local resources, Computing maximum non-crossing matching in convex bipartite graphs, Approximability of minimum certificate dispersal with tree structures, Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves, A $5k$-vertex kernel for $P_2$-packing, Distribution-Free Consistent Independence Tests via Center-Outward Ranks and Signs, Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended, Ridesharing for emergency evacuation, Destroying Bicolored $P_3$s by Deleting Few Edges, On graphs admitting two disjoint maximum independent sets, PARALLEL APPROXIMATE MATCHING, Coloring Sums of Extensions of Certain Graphs, A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs, GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY, On the complexity of graph reconstruction, Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching, A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs, A new polynomial-time algorithm for the maximum weighted (?(G) ? 1)-coloring problem in comparability graphs, Geometry Helps to Compare Persistence Diagrams, On generalization/specialization for conceptual graphs, Elimination Distances, Blocking Sets, and Kernels for Vertex Cover, Blocking trails for $f$-factors of multigraphs, A weight-scaling algorithm for $f$-factors of multigraphs, Tiling with Squares and Packing Dominos in Polynomial Time, Data Reduction for Maximum Matching on Real-World Graphs, On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves, Topological Aspects of Matrix Abduction 2, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Enumerating Grid Layouts of Graphs, A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs, Lattice complete graphs, A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs, Precoloring Extension III: Classes of Perfect Graphs, A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs, Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs, Bell's Primeness Criterion for W(2n + 1), Fully dynamic MIS in uniformly sparse graphs, A simple augmentation method for matchings with applications to streaming algorithms, Perfect matchings in hexagonal systems, Symbolic elimination in dynamic optimization based on block-triangular ordering, Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version), Bribery and Control in Stable Marriage, Uniform sampling ofk-hypertournaments, A polynomial algorithm to find an independent set of maximum weight in a fork-free graph, A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based Networks, On the maximum edge-pair embedding bipartite matching, Unnamed Item, A survey of direct methods for sparse linear systems, Sublinear Graph Approximation Algorithms, Unnamed Item, Unnamed Item, Unnamed Item, On completing latin squares, On conceptually simple algorithms for variants of online bipartite matching, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Approximating Largest Convex Hulls for Imprecise Points, On the anti-Kekulé problem of cubic graphs, A fixed-parameter-tractable algorithm for set packing, Edge coloring of bipartite graphs with constraints, The asymmetric median tree. --- A new model for building consensus trees, Local multiple alignment via subgraph enumeration, On $H$-topological intersection graphs, On $(s,t)$-relaxed $L(2,1)$-labeling of graphs, Linear representation of transversal matroids and gammoids parameterized by rank, Graph isomorphism restricted by lists, Fixed-parameter tractability of $(n-k)$ list coloring, Disjoint paths and connected subgraphs for $H$-free graphs, Disjoint paths and connected subgraphs for $H$-free graphs, Obtaining a proportional allocation by deleting items, Min-Cost Flow in Unit-Capacity Planar Graphs, INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS, A Polynomial 3/5-Approximate Algorithm for the Asymmetric Maximization Version of the 3-PSP, Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs, Depth First Search in the Semi-streaming Model, Finding a Small Number of Colourful Components, Lower Bounds for DeMorgan Circuits of Bounded Negation Width, Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ, Approximation algorithms in combinatorial scientific computing, Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier, A New Framework for Hierarchical Drawings, Notes on Hazard-Free Circuits, Kernelization of Graph Hamiltonicity: Proper $H$-Graphs, Unnamed Item, The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs, The Power of Linear-Time Data Reduction for Maximum Matching, Parameterized Algorithms and Kernels for Rainbow Matching, A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS, Weighted popular matchings, Planar 3-SAT with a clause/variable cycle, Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region, Fully Dynamic Maximal Matching in $O(\log n)$ Update Time, Efficient maximum matching algorithms for trapezoid graphs, Unnamed Item, Unnamed Item, The structural index of sensitivity equation systems, A key inequality for lower bound formulas for lattice event probabilities, Unnamed Item, Determining the Hausdorff Distance Between Trees in Polynomial Time, Efficient dual simplex algorithms for the assignment problem, Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations, Minimum Certificate Dispersal with Tree Structures, Fully Dynamic Matching in Bipartite Graphs, Complexity of a disjoint matching problem on bipartite graphs, An extension of Hall's theorem for partitioned bipartite graphs, The optimal tenement allocation for reducing traffic burden, Node-Balancing by Edge-Increments, Interval incidence coloring of bipartite graphs, Approximating 2-cliques in unit disk graphs, Complexity results for rainbow matchings, A heuristic for decomposing traffic matrices in TDMA satellite communication, Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees, A General Testability Theory, Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings, Packings by Complete Bipartite Graphs, Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—, Linear-Time Approximation for Maximum Weight Matching, Attributed relational graph matching based on the nested assignment structure, Full transversal matroids, strict gammoids, and the matroid components problem, Ranking intervals under visibility constraints^∗, The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes, Efficient random graph matching via degree profiles, Hardness and approximation of minimum maximal matchings, Sensitivity analysis of linear systems—a structural approach, Security index based on perfectly undetectable attacks: graph-theoretic conditions, The Generalized Popular Condensation Problem, Speeding up Graph Algorithms via Switching Classes, A linear-time parameterized algorithm for computing the width of a DAG, Lower bounds for Boolean circuits of bounded negation width, Advice complexity of online non-crossing matching, Deadlock resolution in wait-for graphs by vertex/arc deletion, Better approximability results for min-max tree/cycle/path cover problems, A Polynomial Time Solution for Permutation Scaffold Filling, Just-in-Time Scheduling with Equal-Size Jobs, Probabilistic and exact frequent subtree mining in graphs beyond forests, Structural Identifiability in Low-Rank Matrix Factorization, Covering Directed Graphs by In-Trees, Optimization-Based Approaches for Maximizing Aggregate Recommendation Diversity, Bounded Unpopularity Matchings, An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees, A Path Cover Technique for LCAs in Dags, Bipartite matching in the semi-streaming model, Embedding of complete graphs in broken Chimera graphs, Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines, Classes of perfect graphs, The Null Space Problem II. Algorithms, Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems, Positional Dominance: Concepts and Algorithms, Filtering for Subgraph Isomorphism, Another disjoint compression algorithm for odd cycle transversal, Maximum common induced subgraph parameterized by vertex cover, Packing paths: recycling saves time, On Complexity of Total Vertex Cover on Subcubic Graphs, Bi-criteria and approximation algorithms for restricted matchings, On finding a large number of 3D points with a small diameter, Controllability in Directed Complex Networks: Granular Computing Perspective, Constrained target controllability of complex networks, Reducing rank-maximal to maximum weight matching, Jump Number of Two-Directional Orthogonal Ray Graphs, Approximating Edge Dominating Set in Dense Graphs, Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem, Crown reductions for the minimum weighted vertex cover problem, A note on the decomposition of systems of sparse non-linear equations, Oriented star packings, On Some Problems in the Design of Plane Skeletal Structures, Lattice path matroids: structural properties, Sweep synchronization as a global propagation mechanism, Matching and spanning in certain planar graphs, A polynomial case of the parsimony haplotyping problem, Unnamed Item, A survey on labeling graphs with a condition at distance two, The Simple Reachability Problem in Switch Graphs, Iterative Compression and Exact Algorithms, Fault Diagnosis Of A Water For Injection System Using Enhanced Structural Isolation, Maximum Rank of Powers of a Matrix of a Given Pattern, On the Grundy Number of a Graph, Colinear Coloring on Graphs, On global warming: Flow-based soft global constraints, Approximating the minimum clique cover and other hard problems in subtree filament graphs, Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs, Throughput analysis in wireless networks with multiple users and multiple channels, Fixed-parameter algorithms for scaffold filling, Similarity Indices for Spatia I Ecological Data, New Genome Similarity Measures Based on Conserved Gene Adjacencies, TRIANGLE-FREE 2-MATCHINGS REVISITED, On the Power of Simple Reductions for the Maximum Independent Set Problem, A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs, A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles, Using euler partitions to edge color bipartite multigraphs, Optimal Partial Tiling of Manhattan Polyominoes, Maximum matching of given weight in complete and complete bipartite graphs, A Representation of bipartite graphs by digraphs and its programming application, Variations on Instant Insanity, Constrained tree inclusion, DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY, The exchange-stable marriage problem, A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs, Finding Largest Common Point Sets, On balanced graphs, A local algorithm and its percolation analysis of bipartite z-matching problem, A heuristic approach to domino grid problem, Reducing the vertex cover number via edge contractions, A quest for a fair schedule: the international Young Physicists' Tournament, Equitable scheduling on a single machine, Exact and heuristic methods for a workload allocation problem with chain precedence constraints, Solving maximum weighted matching on large graphs with deep reinforcement learning, Approximately counting and sampling knowledge states, Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model, An approximation algorithm for diversity-aware fair $k$-supplier problem, Stability, vertex stability, and unfrozenness for special graph classes, Envy-free matchings in bipartite graphs and their applications to fair division, Structural controllability and observability of complex network with output feedback, Decomposing Random Permutations into Order-Isomorphic Subpermutations, On maximum bipartite matching with separation, What Is Known About Vertex Cover Kernelization?, On $r$-guarding SCOTs -- a new family of orthogonal polygons, Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages, Weak stability against robust deviations and the bargaining set in the roommate problem, The power of amortized recourse for online graph problems, A planner-optimal matching mechanism and its incentive compatibility in a restricted domain, New approximation results on graph matching and related problems, Filling crosswords is very hard, Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching, Bottleneck profiles and discrete Prokhorov metrics for persistence diagrams, Diverse Pairs of Matchings, Contracting to a longest path in H-free graphs, Approximating latin square extensions, Faster algorithm for finding maximum 1-restricted simple 2-matchings, Recovery of disrupted airline operations using $k$-maximum matching in graphs