On the public citation graph

The Complexity of Coloring Circular Arcs and Chords

https://doi.org/10.1137/0601025
0 signed · 367 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.1975.5.1.45openalex-snapshot
On the Computational Complexity of Combinatorial Problems
inferredcites →https://doi.org/10.1002/net.3230030305openalex-snapshot
Algorithms for a maximum clique and a maximum independent set of a circle graph
inferredcites →https://doi.org/10.1002/net.3230040407openalex-snapshot
Algorithms on circular‐arc graphs
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/b978-0-12-417750-5.50011-7openalex-snapshot
QUEUES, STACKS AND GRAPHS
inferredcites →https://doi.org/10.1016/s0012-365x(74)80027-0openalex-snapshot
Structure theorems for some circular-arc graphs
inferredcites →https://doi.org/10.1080/00029890.1969.12000337openalex-snapshot
What Are the Intersection Graphs of Arcs in a Circle?
inferredcites →https://doi.org/10.1137/0129040openalex-snapshot
Coloring a Family of Circular Arcs
inferredcites →https://doi.org/10.1137/0209001openalex-snapshot
An Efficient Test for Circular-Arc Graphs
inferredcites →https://doi.org/10.2140/pjm.1971.39.535openalex-snapshot
Matrix characterizations of circular-arc graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4056121openalex-extracted
New Formulation for Coloring Circle Graphs And its Application to Capacitated Stowage Stack Minimization
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(200004)33:4<256::aid-jgt7>3.0.co;2-2openalex-snapshot
The round-up property of the fractional chromatic number for proper circular arc graphs
inferred← citeshttps://doi.org/10.1002/1097-0037(200007)35:4<248::aid-net2>3.0.co;2-9openalex-snapshot
Wavelength allocation on trees of rings
inferred← citeshttps://doi.org/10.1002/9780470611098.ch10openalex-snapshot
Complexity and Approximation Results for the Min Weighted Node Coloring Problem
inferred← citeshttps://doi.org/10.1002/jgt.22436openalex-snapshot
Extending partial representations of circle graphs
inferred← citeshttps://doi.org/10.1002/jgt.22486openalex-snapshot
Characterization and linear‐time detection of minimal obstructions to concave‐round graphs and the circular‐ones property
inferred← citeshttps://doi.org/10.1002/jgt.23098openalex-snapshot
Bisimplicial separators
inferred← citeshttps://doi.org/10.1002/jos.92openalex-snapshot
Cyclic scheduling in a robotic production line
inferred← citeshttps://doi.org/10.1002/nav.20231openalex-snapshot
Interval scheduling: A survey
inferred← citeshttps://doi.org/10.1002/net.20257openalex-snapshot
On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
inferred← citeshttps://doi.org/10.1002/net.21618openalex-snapshot
Selecting vertex disjoint paths in plane graphs
inferred← citeshttps://doi.org/10.1002/net.3230120410openalex-snapshot
Efficient algorithms for interval graphs and circular‐arc graphs
inferred← citeshttps://doi.org/10.1002/net.3230230424openalex-snapshot
Off‐line permutation routing on circuit‐switched fixed‐routing networks
inferred← citeshttps://doi.org/10.1006/inco.1997.2697openalex-snapshot
All Structured Programs Have Small Tree Width and Good Register Allocation
inferred← citeshttps://doi.org/10.1006/jagm.1998.1001openalex-snapshot
A Greedy On-Line Algorithm for thek-Track Assignment Problem
inferred← citeshttps://doi.org/10.1006/jagm.1999.1049openalex-snapshot
On Crossing Sets, Disjoint Sets, and Pagenumber
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1789openalex-snapshot
A Genetic Algorithm for Finding the Pagenumber of Interconnection Networks
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_95openalex-snapshot
Directed Tree Networks
inferred← citeshttps://doi.org/10.1007/10719839_32openalex-snapshot
On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths Extended Abstract
inferred← citeshttps://doi.org/10.1007/11560586_17openalex-snapshot
Weighted Coloring: Further Complexity and Approximability Results
inferred← citeshttps://doi.org/10.1007/11573036_6openalex-snapshot
Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree
inferred← citeshttps://doi.org/10.1007/11602613_82openalex-snapshot
Minimum Entropy Coloring
inferred← citeshttps://doi.org/10.1007/11671541_3openalex-snapshot
Approximation Algorithms for Path Coloring in Trees
inferred← citeshttps://doi.org/10.1007/11690634_6openalex-snapshot
Register Allocation After Classical SSA Elimination is NP-Complete
inferred← citeshttps://doi.org/10.1007/11785293_39openalex-snapshot
Generalized Powers of Graphs and Their Algorithmic Use
inferred← citeshttps://doi.org/10.1007/11922377_6openalex-snapshot
Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1007/3-540-16766-8_20openalex-snapshot
Linear and book embeddings of graphs
inferred← citeshttps://doi.org/10.1007/3-540-16766-8_9openalex-snapshot
Diogenes, circa 1986 Ψαχνω για ενα τιμιo ανϑρoπo
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_31openalex-snapshot
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_13openalex-snapshot
On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_31openalex-snapshot
Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_59openalex-snapshot
Algorithmic Aspects of Bandwidth Trading
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_67openalex-snapshot
Call Control in Rings
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_13openalex-snapshot
Random Arc Allocation and Applications
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_37openalex-snapshot
The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_179openalex-snapshot
Compiler-Directed Reordering of Data by Cyclic Graph Coloring
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_21openalex-snapshot
Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_25openalex-snapshot
NC algorithms for circular-arc graphs
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_13openalex-snapshot
Bounds to the page number of partially ordered sets
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_199openalex-snapshot
The complexity of colouring circle graphs
inferred← citeshttps://doi.org/10.1007/3-540-55984-1_17openalex-snapshot
A register allocation framework based on hierarchical cyclic interval graphs
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_97openalex-snapshot
Restricted track assignment with applications
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_149openalex-snapshot
Efficient deterministic algorithms for embedding graphs on books
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_75openalex-snapshot
Efficient wavelength routing on directed fiber trees
inferred← citeshttps://doi.org/10.1007/3-540-62559-3_23openalex-snapshot
The Optimal Cost Chromatic Partition problem for trees and interval graphs
inferred← citeshttps://doi.org/10.1007/978-0-8176-8322-1_12openalex-snapshot
Games for Routing and Path Coloring
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_21openalex-snapshot
Coloring Clean and K 4-Free Circle Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4757-3563-5_3openalex-snapshot
Wavelength Assignment
inferred← citeshttps://doi.org/10.1007/978-1-4757-4419-4_6openalex-snapshot
Overlapped Scheduling Techniques for High-Level Synthesis and Multiprocessor Realizations of DSP Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-11509-8_11openalex-snapshot
On Rectangle Intersection Graphs with Stab Number at Most Two
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_1openalex-snapshot
Succinct Data Structures for Families of Interval Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_34openalex-snapshot
Local and Union Page Numbers
inferred← citeshttps://doi.org/10.1007/978-3-030-59267-7_35openalex-snapshot
Fixed-Order Book Thickness with Respect to the Vertex-Cover Number: New Observations and Further Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_38openalex-snapshot
Parameterized Algorithms for Fixed-Order Book Drawing with Bounded Number of Crossings per Edge
inferred← citeshttps://doi.org/10.1007/978-3-031-09993-9_12openalex-snapshot
Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-031-15914-5_17openalex-snapshot
Extending Partial Representations of Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-63021-7_12openalex-snapshot
Detecting $$K_{2,3}$$ as an Induced Minor
inferred← citeshttps://doi.org/10.1007/978-3-032-00281-5_24openalex-snapshot
New Formulation for Coloring Circle Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_12openalex-snapshot
Extending Partial Representations of Circle Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-07467-2_48openalex-snapshot
The Stowage Stack Minimization Problem with Zero Rehandle Constraint
inferred← citeshttps://doi.org/10.1007/978-3-319-27119-4_10openalex-snapshot
A Power-Conserving Online Scheduling Scheme for Video Streaming Services
inferred← citeshttps://doi.org/10.1007/978-3-319-71147-8_22openalex-snapshot
Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_23openalex-snapshot
Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-31956-6_24openalex-snapshot
Wavelength Assignment in Route-Fixed Optical WDM Ring by a Branch-and-Price Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_5openalex-snapshot
Line System Design and a Generalized Coloring Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_18openalex-snapshot
Tree-Partitions of k-Trees with Applications in Graph Layout
inferred← citeshttps://doi.org/10.1007/978-3-540-46824-0_5openalex-snapshot
Bindung
inferred← citeshttps://doi.org/10.1007/978-3-540-48413-4_22openalex-snapshot
A New Approximation Algorithm for the Demand Routing and Slotting Problem with Unit Demands on Rings
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_6openalex-snapshot
Wavelength Management in WDM Rings to Maximize the Number of Connections
inferred← citeshttps://doi.org/10.1007/978-3-540-72521-3_21openalex-snapshot
Register Allocation: What Does the NP-Completeness Proof of Chaitin et al. Really Prove? Or Revisiting Register Allocation: Why and How
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_14openalex-snapshot
Geometric Intersection Graphs: Do Short Cycles Help?
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_63openalex-snapshot
Randomized and Approximation Algorithms for Blue-Red Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-77294-1_8openalex-snapshot
Selfish Routing and Path Coloring in All-Optical Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-02026-1_50openalex-snapshot
An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_9openalex-snapshot
Minimum Entropy Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-04241-6_14openalex-snapshot
K-Partite RNA Secondary Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_11openalex-snapshot
Sub-coloring and Hypo-coloring Interval Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_2openalex-snapshot
A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_6openalex-snapshot
Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy
inferred← citeshttps://doi.org/10.1007/978-3-642-24043-0_47openalex-snapshot
A Hybrid Evolutionary Algorithm for the Page Number Minimization Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-28050-4_19openalex-snapshot
Parameterized Maximum Path Coloring
inferred← citeshttps://doi.org/10.1007/978-3-642-33182-4_8openalex-snapshot
Optimizing a Geomodeling Domain Specific Language
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_8openalex-snapshot
Optimization Problems in Dotted Interval Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-37051-9_1openalex-snapshot
Optimal Register Allocation in Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_29openalex-snapshot
Approximation Algorithms for B 1-EPG Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-12629-5_26openalex-snapshot
Structure Independent Optimization of Embedding Graphs in Books
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_12openalex-snapshot
Periodic Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_8openalex-snapshot
Parameters of Partial Orders and Graphs: Packing, Covering, and Representation
inferred← citeshttps://doi.org/10.1007/978-981-10-4741-1_10openalex-snapshot
An Adaptive Grouping Scheme for Avoiding Hidden Node Collision in IEEE 802.15.4 LR-WPAN
inferred← citeshttps://doi.org/10.1007/bf01097528openalex-snapshot
Representations of graphs and networks (coding, layouts and embeddings)
inferred← citeshttps://doi.org/10.1007/bf01190897openalex-snapshot
Efficient parallel recognition of some circular arc graphs, I
inferred← citeshttps://doi.org/10.1007/bf01864170openalex-snapshot
Algorithmic aspects of intersection graphs and representation hypergraphs
inferred← citeshttps://doi.org/10.1007/bf02238071openalex-snapshot
Thek-track assignment problem
inferred← citeshttps://doi.org/10.1007/bf02523192openalex-snapshot
Efficient parallel recognition of some circular arc graphs, II
inferred← citeshttps://doi.org/10.1007/bfb0024507openalex-snapshot
Structured programs have small tree-width and good register allocation
inferred← citeshttps://doi.org/10.1007/bfb0026433openalex-snapshot
A new fast algorithm for optimal register allocation in modulo scheduled loops
inferred← citeshttps://doi.org/10.1007/bfb0035103openalex-snapshot
Periodic multiprocessor scheduling
inferred← citeshttps://doi.org/10.1007/bfb0035832openalex-snapshot
On the k-colouring of circle-graphs
inferred← citeshttps://doi.org/10.1007/bfb0053971openalex-snapshot
Approximating circular arc colouring and bandwidth allocation in all-optical ring networks
inferred← citeshttps://doi.org/10.1007/s00224-011-9371-2openalex-snapshot
Minimum Entropy Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1007/s00285-011-0493-6openalex-snapshot
On the page number of RNA secondary structures with pseudoknots
inferred← citeshttps://doi.org/10.1007/s00373-022-02510-1openalex-snapshot
2-Nested Matrices: Towards Understanding the Structure of Circle Graphs
inferred← citeshttps://doi.org/10.1007/s00453-001-0023-9openalex-snapshot
An Approximation Algorithm for Circular Arc Colouring
inferred← citeshttps://doi.org/10.1007/s00453-006-0187-4openalex-snapshot
Call Control in Rings
inferred← citeshttps://doi.org/10.1007/s00453-020-00710-wopenalex-snapshot
Succinct Encodings for Families of Interval Graphs
inferred← citeshttps://doi.org/10.1007/s10107-005-0649-5openalex-snapshot
Independent packings in structured graphs
inferred← citeshttps://doi.org/10.1007/s10288-010-0138-4openalex-snapshot
Combinatorial and robust optimisation models and algorithms for railway applications
inferred← citeshttps://doi.org/10.1007/s10479-008-0391-5openalex-snapshot
Exploring the complexity boundary between coloring and list-coloring
inferred← citeshttps://doi.org/10.1007/s10878-005-1411-xopenalex-snapshot
Perfect Circular Arc Coloring
inferred← citeshttps://doi.org/10.1007/s10878-008-9152-2openalex-snapshot
Minimum entropy coloring
inferred← citeshttps://doi.org/10.1007/s10951-011-0259-4openalex-snapshot
Routing equal-size messages on a slotted ring
inferred← citeshttps://doi.org/10.1007/s11401-016-1010-4openalex-snapshot
Embedding generalized Petersen graph in books
inferred← citeshttps://doi.org/10.1007/s11432-021-3405-xopenalex-snapshot
On book thickness parameterized by the vertex cover number
inferred← citeshttps://doi.org/10.1007/s11464-022-1010-5openalex-snapshot
A survey on book-embedding of planar graphs
inferred← citeshttps://doi.org/10.1007/s11573-010-0396-9openalex-snapshot
Solving the flight gate assignment problem using dynamic programming
inferred← citeshttps://doi.org/10.1007/s11573-019-00942-5openalex-snapshot
Integrating truck and workforce scheduling in a cross-dock: analysis of different workforce coordination policies
inferred← citeshttps://doi.org/10.1007/s13370-025-01323-8openalex-snapshot
Klein book embeddings
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90044-5openalex-snapshot
On the chromatic number of multiple interval graphs and overlap graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90052-4openalex-snapshot
An O(qn) algorithm to q-color a proper family of circular arcs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90646-wopenalex-snapshot
Precoloring extension. I. Interval graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90267-dopenalex-snapshot
A simple optimal parallel algorithm for the minimum coloring problem on interval graphs
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90032-9openalex-snapshot
Embedding planar graphs in four pages
inferred← citeshttps://doi.org/10.1016/0166-218x(85)90025-3openalex-snapshot
Dominating sets and domatic number of circular arc graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(89)90011-5openalex-snapshot
An O(n1.5) algorithm to color proper circular arcs
inferred← citeshttps://doi.org/10.1016/0166-218x(92)00036-lopenalex-snapshot
Periodic assignment and graph colouring
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90114-4openalex-snapshot
Two-page book embedding of trees under vertex-neighborhood constraints
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90222-aopenalex-snapshot
Independence and domination in polygon graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00118-wopenalex-snapshot
Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00136-2openalex-snapshot
Intersection graphs of Helly families of subtrees
inferred← citeshttps://doi.org/10.1016/0196-6774(82)90032-3openalex-snapshot
The NP-completeness column: An ongoing gulde
inferred← citeshttps://doi.org/10.1016/0196-6774(84)90037-3openalex-snapshot
Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
inferred← citeshttps://doi.org/10.1016/0196-6774(85)90012-4openalex-snapshot
The NP-completeness column: an ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(88)90023-5openalex-snapshot
Stability in circular arc graphs
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90243-gopenalex-snapshot
Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
inferred← citeshttps://doi.org/10.1016/j.comcom.2005.07.002openalex-snapshot
Grooming of non-uniform traffic on unidirectional and bidirectional rings
inferred← citeshttps://doi.org/10.1016/j.comnet.2004.11.028openalex-snapshot
Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost
inferred← citeshttps://doi.org/10.1016/j.comnet.2012.04.026openalex-snapshot
Layered interval codes for TCAM-based classification
inferred← citeshttps://doi.org/10.1016/j.dam.2004.11.007openalex-snapshot
Conversion of coloring algorithms into maximum weight independent set algorithms
inferred← citeshttps://doi.org/10.1016/j.dam.2006.03.003openalex-snapshot
Approximating the minimum clique cover and other hard problems in subtree filament graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.04.016openalex-snapshot
Mutual exclusion scheduling with interval graphs or related classes, Part I
inferred← citeshttps://doi.org/10.1016/j.dam.2008.04.021openalex-snapshot
Efficient algorithms for wavelength assignment on trees of rings
inferred← citeshttps://doi.org/10.1016/j.dam.2012.08.024openalex-snapshot
Computing and counting longest paths on circular-arc graphs in polynomial time
inferred← citeshttps://doi.org/10.1016/j.dam.2012.12.021openalex-snapshot
Structural results on circular-arc graphs and circle graphs: A survey and the main open problems
inferred← citeshttps://doi.org/10.1016/j.dam.2013.03.015openalex-snapshot
The complexity of register allocation
inferred← citeshttps://doi.org/10.1016/j.dam.2014.04.014openalex-snapshot
Optimization problems in dotted interval graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2014.06.013openalex-snapshot
A constant factor approximation algorithm for boxicity of circular arc graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.08.019openalex-snapshot
Max point-tolerance graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.10.005openalex-snapshot
On the minimum and maximum selective graph coloring problems in some graph classes
inferred← citeshttps://doi.org/10.1016/j.dam.2016.06.009openalex-snapshot
Edge-coloring of 3-uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.01.013openalex-snapshot
List matrix partitions of graphs representing geometric configurations
inferred← citeshttps://doi.org/10.1016/j.dam.2019.10.004openalex-snapshot
Hardness and approximation for L-EPG and B1 -EPG graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.11.003openalex-snapshot
On rectangle intersection graphs with stab number at most two
inferred← citeshttps://doi.org/10.1016/j.dam.2021.05.021openalex-snapshot
Revising Johnson’s table for the 21st century
inferred← citeshttps://doi.org/10.1016/j.dam.2023.12.015openalex-snapshot
On d -stable locally checkable problems parameterized by mim-width
inferred← citeshttps://doi.org/10.1016/j.dam.2024.06.031openalex-snapshot
Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms
inferred← citeshttps://doi.org/10.1016/j.disc.2003.05.001openalex-snapshot
Induced matchings in intersection graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.03.019openalex-snapshot
On coloring problems with local constraints
inferred← citeshttps://doi.org/10.1016/j.dss.2021.113697openalex-snapshot
Maximizing student opportunities for in-person classes under pandemic capacity reductions
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.07.024openalex-snapshot
Hadwiger’s conjecture for proper circular arc graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2022.103507openalex-snapshot
Strong edge coloring of circle graphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.01.049openalex-snapshot
Fixed interval scheduling: Models, applications, computational complexity and algorithms
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.05.011openalex-snapshot
On some applications of the selective graph coloring problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.12.028openalex-snapshot
Inverse chromatic number problems in interval and permutation graphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.04.040openalex-snapshot
Exact and heuristic approaches to the airport stand allocation problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.11.044openalex-snapshot
Scheduling electric vehicle regular charging tasks: A review of deterministic models
inferred← citeshttps://doi.org/10.1016/j.endm.2006.06.064openalex-snapshot
Exploring the complexity boundary between coloring and list-coloring
inferred← citeshttps://doi.org/10.1016/j.endm.2010.05.143openalex-snapshot
On Inverse Chromatic Number problems (Extended abstract)
inferred← citeshttps://doi.org/10.1016/j.endm.2011.05.025openalex-snapshot
String graphs of k-bend paths on a grid
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.08.012openalex-snapshot
The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105445openalex-snapshot
Minimal obstructions to C5-coloring in hereditary graph classes
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.09.013openalex-snapshot
Weighted Coloring: further complexity and approximability results
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.11.007openalex-snapshot
APX-hardness of domination problems in circle graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.11.012openalex-snapshot
Approximating minimum coloring and maximum independent set in dotted interval graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.07.004openalex-snapshot
Subtree filament graphs are subtree overlap graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.12.003openalex-snapshot
Minimum weight feedback vertex sets in circle graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.12.010openalex-snapshot
1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106168openalex-snapshot
List k-colouring P-free graphs: A Mim-width perspective
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103661openalex-snapshot
Compact distributed certification of geometric graph classes
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.05.008openalex-snapshot
Planar graphs that need four pages
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.10.006openalex-snapshot
Treewidth versus clique number. II. Tree-independence number
inferred← citeshttps://doi.org/10.1016/j.jda.2006.07.004openalex-snapshot
Routing permutations and involutions on optical ring networks: complexity results and solution to an open problem
inferred← citeshttps://doi.org/10.1016/j.orl.2004.07.006openalex-snapshot
A short proof of the NP-completeness of minimum sum interval coloring
inferred← citeshttps://doi.org/10.1016/j.sysarc.2005.02.001openalex-snapshot
Time-constrained scheduling of large pipelined datapaths
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.025openalex-snapshot
On the complexity of interval scheduling with a resource constraint
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.025openalex-snapshot
Parameterized complexity in multiple-interval graphs: Domination, partition, separation, irredundancy
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.01.012openalex-snapshot
Parameterized maximum path coloring
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.05.007openalex-snapshot
Complexity and online algorithms for minimum skyline coloring of intervals
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.021openalex-snapshot
On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.11.010openalex-snapshot
Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113825openalex-snapshot
On algorithmic applications of sim-width and mim-width of (H1,H2)-free graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00542-3openalex-snapshot
Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00167-3openalex-snapshot
Routing and path multicoloring
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00077-xopenalex-snapshot
A note on optical routing on trees
inferred← citeshttps://doi.org/10.1016/s0020-0255(98)10081-6openalex-snapshot
Jump number maximization for proper interval graphs and series—parallel graphs
inferred← citeshttps://doi.org/10.1016/s0022-0000(02)00004-1openalex-snapshot
The longest common subsequence problem for sequences with nested arc annotations
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00309-7openalex-snapshot
An approximation result for a periodic allocation problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00245-0openalex-snapshot
Container ship stowage problem: complexity and connection to the coloring of circle graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(04)80059-1openalex-snapshot
Not So Perfect Graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(04)80062-1openalex-snapshot
Epilogue 2004
showing the first 200 of 357
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.