Cited in
(only showing first 100 items - show all)- A multicommodity flow problem
- The time complexity of permutation routing via matching, token swapping and a variant
- Maximum matching in multi-interface networks
- Induced matchings in subcubic graphs without short cycles
- Matchings in graphs of odd regularity and girth
- On Ramsey minimal graphs
- Nucleolus computation for some structured TU games via graph theory and linear algebra
- Linear hypergraphs with large transversal number and maximum degree two
- A graph approximation heuristic for the vertex cover problem on planar graphs
- Block triangularization of skew-symmetric matrices
- A characterization of König-Egerváry graphs using a common property of all maximum matchings
- The delta-sum of matching delta-matroids
- Optimum distance flag codes from spreads via perfect matchings in graphs
- Maximum matchings in a class of random graphs
- Coverings and delta-coverings
- Fair-by-design matching
- On a generalization of the Chvátal-Gomory closure
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Bayesian locally optimal design of knockout tournaments
- Optimizing regenerator cost in traffic grooming
- Efficient parallel algorithms for parameterized problems
- Strong product of factor-critical graphs
- A deterministic parallel reduction from weighted matroid intersection search to decision
- On the Keevash-Knox-Mycroft conjecture
- Efficient Algorithms for (3,1) Graphs
- On maximum matchings in 5-regular and 6-regular multigraphs
- Eine Min-Max Beziehung für das Exakte Matroid Problem. (A min-max relation for the exact matroid problem)
- Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs
- Linear time approximation algorithms for~degree~constrained subgraph problems
- On the König graphs for a 5-path and its spanning supergraphs
- Dynamic matching with better-than-2 approximation in polylogarithmic update time
- Cup stacking in graphs
- Quick or cheap? Breaking points in dynamic markets
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
- A strongly polynomial-time algorithm for weighted general factors with three feasible degrees
- On the complexity of the eigenvalue deletion problem
- Succinct planar encoding with minor operations
- Exact matching: correct parity and FPT parameterized by independence number
- Approximation with a fixed number of solutions of some multiobjective maximization problems
- Matchings of cycles and paths in directed graphs
- Altruistically unbalanced kidney exchange
- Heuristically guided search and chromosome matching
- On the recognition of fuzzy circular interval graphs
- Weighted connected matchings
- Packings and perfect path double covers of maximal planar graphs
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
- A generalized hypergreedy algorithm for weighted perfect matching
- On retracts, absolute retracts, and foldings in cographs
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- Natalie 2.0: sparse global network alignment as a special case of quadratic assignment
- Fast algorithms for the undirected negative cost cycle detection problem
- My experiences as a student and researcher in OR during the 1960's and 70's
- A primal dual integer programming algorithm
- Partial ML estimation for spatial autoregressive nonlinear probit models with autoregressive disturbances
- From one to many rainbow Hamiltonian cycles
- Factors and factorizations of graphs—a survey
- A (2 + ) k-vertex kernel for the dual coloring problem
- Hierarchical \(b\)-matching
- Euclidean maximum matchings in the plane -- local to global
- \(\mathrm P \overset {?} {=} \mathrm{NP}\)
- A primal-dual approximation algorithm for \textsc{minsat}
- Kidney exchange: an egalitarian mechanism
- A reduction algorithm for the weighted stable set problem in claw-free graphs
- Duality theorems for finite structures (characterising gaps and good characterisations)
- Critical paired dominating sets and irreducible decompositions of powers of edge ideals
- Partitioning a graph into two pieces, each isomorphic to the other or to its complement
- Partition into cliques for cubic graphs: Planar case, complexity and approximation
- Socially fair matching: exact and approximation algorithms
- Induced matchings in graphs of bounded maximum degree
- On the maximum 2-1 matching
- Notes on weak-odd edge colorings of digraphs
- Minimum-maximal matching in series-parallel graphs
- Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs
- The time complexity of the token swapping problem and its parallel variants
- Optimal general factor problem and jump system intersection
- A note on the relation between polynomial time functionals and Constable's class \(\mathcal K\)
- Reinforcement learning for optimal error correction of toric codes
- Perfect matching in random graphs is as hard as Tseitin
- Matchings in multipartite hypergraphs
- Graph theoretic relaxations of set covering and set partitioning problems
- An efficient distributed algorithm for maximum matching in general graphs
- Second kind maximum matching graph
- Efficient recognition of equimatchable graphs
- Exact algorithms for dominating set
- FPT algorithms for path-transversal and cycle-transversal problems
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
- The roommates problem revisited
- Conservative weightings and ear-decompositions of graphs
- The Legacy of Turing in Numerical Analysis
- Extremal perfect graphs for a bound on the domination number
- Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points
- Anti-factor is FPT parameterized by treewidth and list size (but counting is hard)
- Exact exponential algorithms for clustering problems
- Ear-decompositions of matching-covered graphs
- Irreducible decomposition of powers of edge ideals, computing dstab, astab.
- Per-spectral characterizations of graphs with extremal per-nullity
- Perfect stables in graphs
- A local search algorithm for large maximum weight independent set problems
- The distance-edge-monitoring numbers of subdivision graphs
- Elementary graphs with respect to \(f\)-parity factors
This page was built for publication: Paths, Trees, and Flowers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5341586)
