On the public citation graph

On the Sum Coloring Problem on Interval Graphs

0 signed · 74 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/jgt.3190130310openalex-snapshot
Tight bounds on the chromatic sum of a connected graph
inferredcites →https://doi.org/10.1002/net.3230120410openalex-snapshot
Efficient algorithms for interval graphs and circular‐arc graphs
inferredcites →https://doi.org/10.1007/bfb0038467openalex-snapshot
Approximation algorithms for the chromatic sum
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1109/tc.1984.1676428openalex-snapshot
Complexity of Single-Layer Routing
inferredcites →https://doi.org/10.1109/tcad.1987.1270250openalex-snapshot
Finding a Maximum Planar Subset of a Set of Nets in a Channel
inferredcites →https://doi.org/10.1137/s0097539796303123openalex-snapshot
Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete
inferredcites →https://doi.org/10.1145/75427.75430openalex-snapshot
An introduction to chromatic sums
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.5555/113938.149639openalex-snapshot
Over-the-cell channel routing for high performance circuits

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470612507.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1006/jagm.1998.0938openalex-snapshot
Minimum Color Sum of Bipartite Graphs
inferred← citeshttps://doi.org/10.1006/jagm.2000.1106openalex-snapshot
Sum Multicoloring of Graphs
inferred← citeshttps://doi.org/10.1006/jagm.2001.1210openalex-snapshot
Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees
inferred← citeshttps://doi.org/10.1007/11830924_13openalex-snapshot
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
inferred← citeshttps://doi.org/10.1007/3-540-44666-4_15openalex-snapshot
Minimizing Average Completion of Dedicated Tasks and Interval Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_44openalex-snapshot
The Complexity of Tree Multicolorings
inferred← citeshttps://doi.org/10.1007/3-540-45753-4_13openalex-snapshot
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_34openalex-snapshot
Sum Multi-coloring of Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_108-1openalex-snapshot
Exact Approaches for Scheduling Problems on Parallel Identical Machines with Conflict Jobs
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_8openalex-snapshot
Concurrency Constrained Scheduling with Tree-Like Constraints
inferred← citeshttps://doi.org/10.1007/978-3-032-30530-5_6openalex-snapshot
The Minimum Sum Coloring Problem on Circulant Graphs $$C_n(1,2)$$
inferred← citeshttps://doi.org/10.1007/978-3-319-51741-4_5openalex-snapshot
Batch Coloring of Graphs
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_6openalex-snapshot
A Simple and Fast Approach for Solving Problems on Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_2openalex-snapshot
Multicoloring: Problems and Techniques
inferred← citeshttps://doi.org/10.1007/978-3-540-31833-0_8openalex-snapshot
Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria
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_30openalex-snapshot
The Probabilistic Minimum Coloring Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-48413-4_8openalex-snapshot
Multicoloring Planar Graphs and Partial k-Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_9openalex-snapshot
Minimum Entropy Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1007/s00037-005-0201-2openalex-snapshot
The complexity of chromatic strength and chromatic edge strength
inferred← citeshttps://doi.org/10.1007/s00224-011-9371-2openalex-snapshot
Minimum Entropy Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1007/s00373-012-1269-5openalex-snapshot
On the Minimum Sum Coloring of P 4-Sparse Graphs
inferred← citeshttps://doi.org/10.1007/s00453-003-1031-8openalex-snapshot
Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs
inferred← citeshttps://doi.org/10.1007/s00453-004-1111-4openalex-snapshot
Sum Coloring of Bipartite Graphs with Bounded Degree
inferred← citeshttps://doi.org/10.1007/s00453-007-9161-zopenalex-snapshot
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
inferred← citeshttps://doi.org/10.1007/s00453-017-0386-1openalex-snapshot
Batch Coloring of Graphs
inferred← citeshttps://doi.org/10.1007/s00454-023-00508-xopenalex-snapshot
Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete
inferred← citeshttps://doi.org/10.1007/s10462-016-9485-7openalex-snapshot
Algorithms for the minimum sum coloring problem: a review
inferred← citeshttps://doi.org/10.1007/s10951-006-0003-7openalex-snapshot
Time slot scheduling of compatible jobs
inferred← citeshttps://doi.org/10.1007/s11227-019-02761-5openalex-snapshot
Finding the chromatic sums of graphs using a D-Wave quantum computer
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.comnet.2017.02.016openalex-snapshot
RFC: Range feature code for TCAM-based packet classification
inferred← citeshttps://doi.org/10.1016/j.dam.2005.06.007openalex-snapshot
On the probabilistic minimum coloring and minimum k -coloring
inferred← citeshttps://doi.org/10.1016/j.dam.2008.04.002openalex-snapshot
Complexity results for minimum sum edge coloring
inferred← citeshttps://doi.org/10.1016/j.dam.2009.04.020openalex-snapshot
Minimum sum edge colorings of multicycles
inferred← citeshttps://doi.org/10.1016/j.dam.2010.11.018openalex-snapshot
Minimum sum set coloring of trees and line graphs of trees
inferred← citeshttps://doi.org/10.1016/j.dam.2011.06.029openalex-snapshot
8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009)
inferred← citeshttps://doi.org/10.1016/j.disc.2003.06.015openalex-snapshot
Sum coloring and interval graphs: a tight upper bound for the minimum number of colors
inferred← citeshttps://doi.org/10.1016/j.endm.2008.01.002openalex-snapshot
A New Neighborhood for the QAP
inferred← citeshttps://doi.org/10.1016/j.endm.2008.01.008openalex-snapshot
Chromatic Edge Strength of Some Multigraphs
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.048openalex-snapshot
Minimum Sum Coloring of P4-sparse graphs
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.07.009openalex-snapshot
Data migration to minimize the total completion time
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.08.002openalex-snapshot
On the performance guarantee of First Fit for sum coloring
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.11.010openalex-snapshot
On sum coloring and sum multi-coloring for restricted families of graphs
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/s0012-365x(00)00006-6openalex-snapshot
Feasible edge colorings of trees with cardinality constraints
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00005-2openalex-snapshot
On the cost-chromatic number of graphs
inferred← citeshttps://doi.org/10.1051/ro/2025140openalex-snapshot
An exact algorithm for the minimum sum coloring problem on partially decomposable graphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxm048openalex-snapshot
Parameterized Complexity and Approximation Algorithms
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062045openalex-snapshot
Layered Interval Codes for TCAM-Based Classification
inferred← citeshttps://doi.org/10.1109/soli.2008.4682840openalex-snapshot
A heuristic method for online warehouse storage assignment problem
inferred← citeshttps://doi.org/10.1109/tnet.2015.2411274openalex-snapshot
TCAM-Based Multi-Match Packet Classification Using Multidimensional Rule Layering
inferred← citeshttps://doi.org/10.1134/s1995423911030013openalex-snapshot
Graph coloring in a class of parallel local algorithms
inferred← citeshttps://doi.org/10.1137/s0097539796303123openalex-snapshot
Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete
inferred← citeshttps://doi.org/10.1145/1328911.1328922openalex-snapshot
Improved bounds for scheduling conflicting jobs with minsum criteria
inferred← citeshttps://doi.org/10.1145/1375457.1375513openalex-snapshot
Layered interval codes for tcam-based classification
inferred← citeshttps://doi.org/10.1155/s0161171204306216openalex-snapshot
The chromatic sum of a graph: history and recent developments
inferred← citeshttps://doi.org/10.1201/9781351236423-38openalex-snapshot
Algorithms for Chromatic Sums, Multicoloring, and Scheduling Dependent Jobs
inferred← citeshttps://doi.org/10.22028/d291-25865openalex-snapshot
Fast algorithms for two scheduling problems
inferred← citeshttps://doi.org/10.48550/arxiv.1610.02997openalex-snapshot
Batch Coloring of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2102.06043openalex-snapshot
Exact Algorithms for Scheduling Problems on Parallel Identical Machines with Conflict Jobs
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.