Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Harper, L.H.
and
Dreier, D.
2003.
The edge-isoperimetric problem on the 600-vertex regular solid.
Linear Algebra and its Applications,
Vol. 368,
Issue. ,
p.
209.
Balogh, József
Mubayi, Dhruv
and
Pluhár, András
2006.
On the edge-bandwidth of graph products.
Theoretical Computer Science,
Vol. 359,
Issue. 1-3,
p.
43.
Bharadwaj, B. V. S.
Chandran, L. S.
and
Das, Anita
2008.
Computing and Combinatorics.
Vol. 5092,
Issue. ,
p.
22.
Rajasingh, Indra
and
Arockiaraj, Micheal
2011.
Linear Wirelength of Folded Hypercubes.
Mathematics in Computer Science,
Vol. 5,
Issue. 1,
p.
101.
Mossel, Elchanan
and
Rácz, Miklós Z.
2012.
A quantitative gibbard-satterthwaite theorem without neutrality.
p.
1041.
RANJAN, DESH
and
ZUBAIR, MOHAMMAD
2012.
VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH.
International Journal of Foundations of Computer Science,
Vol. 23,
Issue. 04,
p.
941.
Aslanyan, Levon H.
and
Danoyan, H. E.
2013.
On the optimality of the hash-coding type nearest neighbour search algorithm.
p.
1.
Sahakyan, Hasmik
2013.
(0,1)-Matrices with different rows.
p.
1.
Rajasingh, Indra
Manuel, Paul
Arockiaraj, M.
and
Rajan, Bharati
2013.
Embeddings of circulant networks.
Journal of Combinatorial Optimization,
Vol. 26,
Issue. 1,
p.
135.
Mainini, Edoardo
Piovano, Paolo
and
Stefanelli, Ulisse
2014.
Finite crystallization in the square lattice.
Nonlinearity,
Vol. 27,
Issue. 4,
p.
717.
Adiga, Abhijin
Chandran, L. Sunil
and
Sivadasan, Naveen
2014.
Lower bounds for boxicity.
Combinatorica,
Vol. 34,
Issue. 6,
p.
631.
Rajan, R. Sundara
Parthiban, N.
and
Rajalaxmi, T. M.
2015.
Embedding of Recursive Circulants into Certain Necklace Graphs.
Mathematics in Computer Science,
Vol. 9,
Issue. 2,
p.
253.
Rajan, R. Sundara
Rajasingh, Indra
Manuel, Paul
Rajalaxmi, T. M.
and
Parthiban, N.
2015.
Combinatorial Algorithms.
Vol. 8986,
Issue. ,
p.
298.
Sundara Rajan, R.
Rajasingh, Indra
Manuel, Paul
Miller, Mirka
and
Rajalaxmi, T. M.
2015.
Maximum incomplete recursive circulants in graph embeddings.
Discrete Mathematics, Algorithms and Applications,
Vol. 07,
Issue. 04,
p.
1550053.
Ahlswede, Rudolf
Ahlswede, Alexander
Althöfer, Ingo
Deppe, Christian
and
Tamm, Ulrich
2015.
Transmitting and Gaining Data.
Vol. 11,
Issue. ,
p.
323.
Mossel, Elchanan
and
Rácz, Miklós Z.
2015.
A quantitative Gibbard-Satterthwaite theorem without neutrality.
Combinatorica,
Vol. 35,
Issue. 3,
p.
317.
Manuel, Paul
Rajasingh, Indra
Rajan, R. Sundara
Parthiban, N.
and
Rajalaxmi, T. M.
2015.
Algorithms and Discrete Applied Mathematics.
Vol. 8959,
Issue. ,
p.
229.
Sundara Rajan, R.
Manuel, Paul
Rajasingh, Indra
Parthiban, N.
and
Miller, Mirka
2015.
A Lower Bound for Dilation of an Embedding.
The Computer Journal,
Vol. 58,
Issue. 12,
p.
3271.
Davoli, Elisa
Piovano, Paolo
and
Stefanelli, Ulisse
2016.
Wulff shape emergence in graphene.
Mathematical Models and Methods in Applied Sciences,
Vol. 26,
Issue. 12,
p.
2277.
Abraham, Jessie
and
Arockiaraj, Micheal
2017.
Algorithms and Discrete Applied Mathematics.
Vol. 10156,
Issue. ,
p.
1.