Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Golumbic, Martin Charles
2004.
Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making.
Vol. 3321,
Issue. ,
p.
352.
Uehara, Ryuhei
2004.
Algorithms and Computation.
Vol. 3341,
Issue. ,
p.
859.
Hell, Pavol
and
Huang, Jing
2004.
Interval bigraphs and circular arc graphs.
Journal of Graph Theory,
Vol. 46,
Issue. 4,
p.
313.
Chang, Maw-Shang
Kloks, Ton
Kratsch, Dieter
Liu, Jiping
and
Peng, Sheng-Lung
2005.
Computing and Combinatorics.
Vol. 3595,
Issue. ,
p.
808.
Golumbic, Martin Charles
2005.
Graph Theory, Combinatorics and Algorithms.
Vol. 34,
Issue. ,
p.
41.
Golumbic, Martin Charles
Lipshteyn, Marina
and
Stern, Michal
2006.
Graph-Theoretic Concepts in Computer Science.
Vol. 4271,
Issue. ,
p.
241.
Chandler, David B.
Chang, Maw-Shang
Kloks, Antonius J. J.
Liu, Jiping
and
Peng, Sheng-Lung
2006.
Theory and Applications of Models of Computation.
Vol. 3959,
Issue. ,
p.
494.
Hagberg, Aric
Swart, Pieter J.
and
Schult, Daniel A.
2006.
Designing threshold networks with given structural and dynamical properties.
Physical Review E,
Vol. 74,
Issue. 5,
Shuchat, Alan
Shull, Randy
and
Trenk, Ann N.
2006.
Range of the Fractional Weak Discrepancy Function.
Order,
Vol. 23,
Issue. 1,
p.
51.
Golumbic, Martin Charles
and
Jamison, Robert E.
2006.
Rank‐tolerance graph classes.
Journal of Graph Theory,
Vol. 52,
Issue. 4,
p.
317.
Calamoneri, Tiziana
and
Petreschi, Rossella
2006.
λ-Coloring matrogenic graphs.
Discrete Applied Mathematics,
Vol. 154,
Issue. 17,
p.
2445.
Lehmann, Katharina A
Kaufmann, Michael
Steigele, Stephan
and
Nieselt, Kay
2006.
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences.
Algorithms for Molecular Biology,
Vol. 1,
Issue. 1,
Restrepo, Guillermo
Mesa, Héber
and
Llanos, Eugenio J.
2007.
Three Dissimilarity Measures to Contrast Dendrograms.
Journal of Chemical Information and Modeling,
Vol. 47,
Issue. 3,
p.
761.
Busch, Arthur H.
and
Isaak, Garth
2007.
Graph-Theoretic Concepts in Computer Science.
Vol. 4769,
Issue. ,
p.
12.
Gardi, Frédéric
2008.
Mutual exclusion scheduling with interval graphs or related classes. Part II.
Discrete Applied Mathematics,
Vol. 156,
Issue. 5,
p.
794.
Cohen, Elad
Golumbic, Martin Charles
Lipshteyn, Marina
and
Stern, Michal
2008.
Graph-Theoretic Concepts in Computer Science.
Vol. 5344,
Issue. ,
p.
275.
McConnell, Ross M.
and
Nussbaum, Yahav
2009.
Algorithms - ESA 2009.
Vol. 5757,
Issue. ,
p.
349.
Brown, David E.
and
Langley, Larry J.
2009.
The Mathematics of Preference, Choice and Order.
p.
313.
Mertzios, George B.
and
Unger, Walter
2010.
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs.
Mathematics in Computer Science,
Vol. 3,
Issue. 1,
p.
85.
Mertzios, George B.
Sau, Ignasi
and
Zaks, Shmuel
2010.
Graph-Theoretic Concepts in Computer Science.
Vol. 5911,
Issue. ,
p.
285.