Restrictions of graph partition problems. I
From MaRDI portal
Publication:672380
DOI10.1016/0304-3975(95)00057-4zbMATH Open0873.68158DBLPjournals/tcs/BodlaenderJ95OpenAlexW2049181186WikidataQ59567991 ScholiaQ59567991MaRDI QIDQ672380FDOQ672380
Authors: Hans L. Bodlaender, Klaus Jansen 
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00057-4
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient algorithms for interval graphs and circular-arc graphs
- Scheduling Interval-Ordered Tasks
- A Linear Recognition Algorithm for Cographs
- The NP-completeness column: an ongoing guide
- On a property of the class of n-colorable graphs
- Processor optimization for flow graphs
Cited In (41)
- Batch processing with interval graph compatibilities between tasks
- Gap one bounds for the equitable chromatic number of block graphs
- Scheduling with machine conflicts
- “Rent-or-Buy” Scheduling and Cost Coloring Problems
- Equitable colorings of bounded treewidth graphs
- Mutual exclusion scheduling with interval graphs or related classes. I
- Asynchronous coordination under preferences and constraints
- Locally boundedk-colorings of trees
- Scheduling: agreement graph vs resource constraints
- On clique partitions of split graphs
- Clique partitioning with value-monotone submodular cost
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
- An improved algorithm for parallel machine scheduling under additional resource constraints
- Capacitated max-batching with interval graph compatibilities
- An efficiently solvable graph partition problem to which many problems are reducible
- Some approximation algorithms for the clique partition problem in weighted interval graphs
- On the thinness and proper thinness of a graph
- Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees
- Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints
- Scheduling identical jobs on uniform machines with a conflict graph
- LATIN 2004: Theoretical Informatics
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms
- Scheduling on uniform machines with a conflict graph: complexity and resolution
- A polynomial characterization of some graph partitioning problems
- New results in two identical machines scheduling with agreement graphs
- Bounded max-colorings of graphs
- Mutual exclusion scheduling with interval graphs or related classes. II
- Scheduling with conflicts: Online and offline algorithms
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
- Transfer flow graphs
- Title not available (Why is that?)
- Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints
- Mutual exclusion scheduling
- A hybrid metaheuristic for the two-dimensional strip packing problem
- Window-based greedy contention management for transactional memory: theory and practice
- Scheduling jobs on identical machines with agreement graph
- On partitioning interval graphs into proper interval subgraphs and related problems
- Tree partitioning under constraints. -- Clustering for vehicle routing problems
- Complexity of graph partition problems
- A competitive analysis for balanced transactional memory workloads
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization
This page was built for publication: Restrictions of graph partition problems. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672380)
