The following pages link to David B. Hartvigsen (Q1103513):
Displayed 41 items.
- (Q221671) (redirect page) (← links)
- (Q1166427) (redirect page) (← links)
- Representing the strengths and directions of pairwise comparisons (Q706886) (← links)
- When do short cycles generate the cycle space? (Q757424) (← links)
- Vote trading in public elections (Q855754) (← links)
- Optimal electronic musical instruments (Q976499) (← links)
- Maximum cardinality 1-restricted simple 2-matchings (Q1010633) (← links)
- The \(S\)-digraph optimization problem and the greedy algorithm (Q1019296) (← links)
- An extension of matching theory (Q1057288) (← links)
- Recognizing max-flow min-cut path matrices (Q1103514) (← links)
- The planar multiterminal cut problem (Q1130183) (← links)
- Packing subgraphs in a graph (Q1166429) (← links)
- Cycle bases from orderings and coverings (Q1182973) (← links)
- The complexity of lifted inequalities for the knapsack problem (Q1201098) (← links)
- Characterizing the flow equivalent trees of a network (Q1811121) (← links)
- Generalizing the all-pairs min cut problem (Q1910514) (← links)
- Multiterminal flows and cuts (Q1924611) (← links)
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs (Q1949271) (← links)
- Finding maximum square-free 2-matchings in bipartite graphs (Q2498740) (← links)
- Compact Representations of Cuts (Q2706189) (← links)
- A Submodular Optimization Problem with Side Constraints (Q2757558) (← links)
- (Q2766105) (← links)
- (Q2999652) (← links)
- Neighbor Systems and the Greedy Algorithm (Q3013153) (← links)
- Maximum Cardinality Simple 2-matchings in Subcubic Graphs (Q3105789) (← links)
- Minimum Path Bases (Q3141525) (← links)
- Path-isomorphic networks (Q3211333) (← links)
- Polyhedral Results for 1-Restricted Simple 2-Matchings (Q3395008) (← links)
- Is every cycle basis fundamental? (Q3476832) (← links)
- The Action Gambler and Equal-Sized Wagering (Q3621146) (← links)
- The prism-free planar graphs and their cycles bases (Q3980625) (← links)
- Recognizing Voronoi Diagrams with Linear Programming (Q4024309) (← links)
- (Q4263715) (← links)
- The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs (Q4307048) (← links)
- Outer-Facial Graphs and the Traveling Salesman Problem (Q4308563) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- A submodular optimization problem with side constraints (Q4645927) (← links)
- Generalized max flows and augmenting paths (Q5101415) (← links)
- Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract) (Q5429256) (← links)
- The <i>k</i>‐piece packing problem (Q5486279) (← links)
- (Q5708503) (← links)
- A strongly polynomial time algorithm for a constrained submodular optimization problem (Q5951962) (← links)