Pages that link to "Item:Q4132234"

The following pages link to On the Complexity of Timetable and Multicommodity Flow Problems (Q4132234):

Displaying 50 items.

• A multistage view on 2-satisfiability (Q2692727) (← links)
• Routing in undirected graphs with constant congestion (Q2817791) (← links)
• Variations on Instant Insanity (Q2848966) (← links)
• Algorithms Solving the Matching Cut Problem (Q2947027) (← links)
• Multiflow Feasibility: An Annotated Tableau (Q2971612) (← links)
• On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas (Q2988835) (← links)
• The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree (Q3057634) (← links)
• OPTIMAL PARALLEL MATCHING ON BIPARTITE PERMUTATION GRAPHS (Q3130156) (← links)
• Multicriteria movement synchronization scheduling problems and algorithms (Q3165912) (← links)
• Finding Two Edge-Disjoint Paths with Length Constraints (Q3181047) (← links)
• Defragmentation of permutation tables with four columns (Q3225893) (← links)
• New Hardness Results for Routing on Disjoint Paths (Q3387753) (← links)
• Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs (Q3439308) (← links)
• Computing Maximal Autarkies with Few and Simple Oracle Queries (Q3453219) (← links)
• The Induced Disjoint Paths Problem (Q3503839) (← links)
• RECONSTRUCTION OF TWO SUBCLASSES OF 2L-CONVEX POLYOMINOES (Q3560057) (← links)
• Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees (Q3602825) (← links)
• NP-Complete operations research problems and approximation algorithms (Q4187586) (← links)
• Minimum-diameter covering problems (Q4520238) (← links)
• Minimum-cost strong network orientation problems: Classification, complexity, and algorithms (Q4540090) (← links)
• Linear-Time Algorithm for Quantum 2SAT (Q4568109) (← links)
• All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs (Q4577772) (← links)
• Computing $k$-Atomicity in Polynomial Time (Q4637504) (← links)
• Integral decomposition in polyhedra (Q4740329) (← links)
• Programação da grade de horário em escolas de ensino fundamental e médio (Q4905620) (← links)
• (Q4972740) (← links)
• Improved approximation for node-disjoint paths in grids with sources on the boundary (Q5002709) (← links)
• Congestion-Free Rerouting of Flows on DAGs (Q5002832) (← links)
• (Q5002847) (← links)
• (Q5009482) (← links)
• (Q5020877) (← links)
• A new adjustment of the branch and price algorithm for university course timetabling (Q5046123) (← links)
• Angle Covers: Algorithms and Complexity (Q5084700) (← links)
• Packing Arc-Disjoint Cycles in Tournaments (Q5092386) (← links)
• (Q5094117) (← links)
• INTERVAL EDGE-COLORINGS OF TREES WITH RESTRICTIONS ON THE EDGES (Q5100181) (← links)
• (Q5111621) (← links)
• Jointly stable matchings (Q5136277) (← links)
• (Q5136330) (← links)
• No-Wait Scheduling for Locks (Q5139604) (← links)
• (Q5158500) (← links)
• A Multimaterial Transport Problem and its Convex Relaxation via Rectifiable $G$-currents (Q5231299) (← links)
• Optimization in telecommunication networks (Q5313481) (← links)
• CASCADING RANDOM WALKS (Q5462126) (← links)
• (Q5463581) (← links)
• The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial (Q5499731) (← links)
• INTERVAL VERTEX-COLORINGS OF CACTUS GRAPHS WITH RESTRICTIONS ON VERTICES (Q5883705) (← links)
• On the use of graphs in discrete tomography (Q5900257) (← links)
• On the use of graphs in discrete tomography (Q5900894) (← links)
• Timetabling problems at the TU Eindhoven (Q5902305) (← links)