Pages that link to "Item:Q1936245"

The following pages link to Bin packing with fixed number of bins revisited (Q1936245):

Displaying 50 items.

• Polynomial kernels for weighted problems (Q340549) (← links)
• Relations between capacity utilization, minimal bin size and bin number (Q490141) (← links)
• On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
• Parameterized complexity of strip packing and minimum volume packing (Q501656) (← links)
• Algorithmic analysis of priority-based bin packing (Q831745) (← links)
• Sorting by multi-cut rearrangements (Q831850) (← links)
• Bin packing with rejection revisited (Q848845) (← links)
• On the bin packing problem with a fixed number of object weights (Q872247) (← links)
• Scheduling and fixed-parameter tractability (Q896271) (← links)
• Refining the complexity of the sports elimination problem (Q896666) (← links)
• Bin packing under linear constraints (Q1679514) (← links)
• An optimization model for freight transport using urban rail transit (Q1754289) (← links)
• Complexity of tree-coloring interval graphs equitably (Q2039688) (← links)
• Envy-free allocations respecting social networks (Q2124438) (← links)
• Hardness and algorithms of equitable tree-coloring problem in chordal graphs (Q2220774) (← links)
• Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
• Parameterized resiliency problems (Q2330129) (← links)
• A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435) (← links)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
• Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees (Q2420639) (← links)
• Edge-disjoint packing of stars and cycles (Q2629232) (← links)
• Parameterized complexity of configuration integer programs (Q2670456) (← links)
• Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges (Q2672432) (← links)
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
• Black and White Bin Packing Revisited (Q3467833) (← links)
• Edge-Disjoint Packing of Stars and Cycles (Q3467879) (← links)
• Iterated Type Partitions (Q5041190) (← links)
• Polynomiality for Bin Packing with a Constant Number of Item Types (Q5056451) (← links)
• (Q5089171) (← links)
• (Q5092394) (← links)
• (Q5111862) (← links)
• Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
• On the generalized bin packing problem (Q5278218) (← links)
• Parameterized Resiliency Problems via Integer Linear Programming (Q5283365) (← links)
• Bounding the running time of algorithms for scheduling and packing problems (Q5890508) (← links)
• Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
• The complexity of tree partitioning (Q5918926) (← links)
• The clever shopper problem (Q5919456) (← links)
• Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
• Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines (Q6065415) (← links)
• Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q6087398) (← links)
• A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics (Q6089980) (← links)
• Equitable scheduling on a single machine (Q6103750) (← links)
• Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
• A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)
• Disentangling the computational complexity of network untangling (Q6151149) (← links)
• Priority-based bin packing with subset constraints (Q6184311) (← links)
• Extended MSO model checking via small vertex integrity (Q6185940) (← links)
• On the parameterized complexity of \textsc{Sparsest Cut} and \textsc{Small-Set Expansion} problems (Q6559388) (← links)
• The parameterized complexity of welfare guarantees in Schelling segregation (Q6614026) (← links)