Electronic Notes in Discrete Mathematics
Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.
Instructions for Preparing Manuscripts
This electronic journal requires that papers are prepared using LaTeX macro files that have been created to ensure a uniform format for the series. Electronic Notes in Discrete Mathematics does NOT publish papers prepared using word processing software. Please click here to download the generic ENDM style package. This package contains the ENDM macro style files as well as instructions on how to use them and a template for preparing your paper.
Copyright Notice
Please note that the publication of an abstract or extended abstract in this journal will NOT restrict the author(s) from publishing a full-length article on the same topic and with the same title in another journal (possibly with another publisher) provided that the original publication is sufficiently enhanced (i.e. approximately doubled in size). However, a simple copyright form must be signed for the (extended) abstract in order for it to be posted on ScienceDirect.
Managing Editor Vadim Lozin
Imprint: Elsevier
ISSN: 1571-0653
Most cited
Top 10 Cited (articles published in the last five years)
Extracted from Scopus (on Fri May 17)Jendrol', S. | Miškuf, J. | Soták, R. Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs Electronic Notes in Discrete Mathematics, Volume 28, 2007-03-01, Pages 281-285 Havet, F. | van den Heuvel, J. | McDiarmid, C. | Reed, B. List Colouring Squares of Planar Graphs Electronic Notes in Discrete Mathematics, Volume 29, Issue SPEC. ISS., 2007-08-15, Pages 515-519 Perboli, G. | Tadei, R. | Tadei, R. New families of valid inequalities for the two-echelon vehicle routing problem Electronic Notes in Discrete Mathematics, Volume 36, Issue C, 2010-08-01, Pages 639-646 Hegde, R. | Jain, K. The Hardness of Approximating Poset Dimension Electronic Notes in Discrete Mathematics, Volume 29, Issue SPEC. ISS., 2007-08-15, Pages 435-443 Brügmann, D. | Komusiewicz, C. | Moser, H. On Generating Triangle-Free Graphs Electronic Notes in Discrete Mathematics, Volume 32, Issue C, 2009-03-15, Pages 51-58 Gitler, I. | Hliněný, P. | Leaños, J. | Salazar, G. The crossing number of a projective graph is quadratic in the face-width Electronic Notes in Discrete Mathematics, Volume 29, Issue SPEC. ISS., 2007-08-15, Pages 219-223 Feder, T. | Hell, P. | Huang, J. | Rafiey, A. Adjusted Interval Digraphs Electronic Notes in Discrete Mathematics, Volume 32, Issue C, 2009-03-15, Pages 83-91 Campos, V. | Linhares Sales, C. | Maffray, F. | Silva, A. b-chromatic number of cacti Electronic Notes in Discrete Mathematics, Volume 35, Issue C, 2009-12-01, Pages 281-286 Hernando, C. | Mora, M. | Pelayo, I.M. | Seara, C. | Wood, D.R. Extremal Graph Theory for Metric Dimension and Diameter Electronic Notes in Discrete Mathematics, Volume 29, Issue SPEC. ISS., 2007-08-15, Pages 339-343 Raj, S.F. | Balakrishnan, R. Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs Electronic Notes in Discrete Mathematics, Volume 34, 2009-08-01, Pages 353-358 - View all items
Special issues
- Buy now
Combinatorics 2012
Volume 40,
Published May 2013 - Buy now
EURO Mini Conference
Volume 39,
Published December 2012 - Buy now
The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011
Volume 38,
Published December 2011
Most downloaded
Most Read Articles - counted by Article downloads on SciVerse ScienceDirect in the period 01 April 2002 to 30 April 2013
Fri May 171 Silvia Mazzeo | Irene Loiseau An Ant Colony Algorithm for the Capacitated Vehicle Routing Electronic Notes in Discrete Mathematics, 1 December 2004, Pages 181-186 2 Giovanni Righini | Matteo Salani Dynamic programming algorithms for the elementary shortest path problem with resource constraints Electronic Notes in Discrete Mathematics, 20 October 2004, Pages 247-249 3 C.M.R.R. Lima | M.C. Goldbarg | E.F.G. Goldbarg A Memetic Algorithm for the Heterogeneous Fleet Vehicle Routing Problem Electronic Notes in Discrete Mathematics, 1 December 2004, Pages 171-176 4 Lorena Pradenas | Fernando Peñailillo | Jacques Ferland Aggregate production planning problem. A new algorithm Electronic Notes in Discrete Mathematics, 1 December 2004, Pages 193-199 5 Semya Elaoud | Jacques Teghem | Taïcir Loukil Multiple crossover genetic algorithm for the multiobjective traveling salesman problem Electronic Notes in Discrete Mathematics, 1 August 2010, Pages 939-946 6 Tim Nieberg Distributed Algorithms in Wireless Sensor Networks Electronic Notes in Discrete Mathematics, April 2003, Pages 81-83 7 Patric R.J. Östergård A New Algorithm for the Maximum-Weight Clique Problem Electronic Notes in Discrete Mathematics, May 1999, Pages 153-156 8 Houda Derbel | Bassem Jarboui | Said Hanafi | Habib Chabchoub An Iterated Local Search for Solving A Location-Routing Problem Electronic Notes in Discrete Mathematics, 1 August 2010, Pages 875-882 9 Domenico Cantone | Simone Faro Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm Electronic Notes in Discrete Mathematics, 20 October 2004, Pages 81-86 10 Elizabeth F.G. Goldbarg | Nelson Maculan | Marco C. Goldbarg A New Neighborhood for the QAP Electronic Notes in Discrete Mathematics, 20 February 2008, Pages 3-8 - View all items
Recent articles
Fri May 171 S. Consoli | J.A. Moreno Pérez Solving the minimum labelling spanning tree problem using hybrid local search Electronic Notes in Discrete Mathematics, 1 December 2012, Pages 75-82 2 Qiuhong Zhao | Chao Xie | Yiyong Xiao A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems Electronic Notes in Discrete Mathematics, 1 December 2012, Pages 129-135 3 Gilberto F. de Sousa Filho | Lucidio dos Anjos F. Cabral | Luiz Satoru Ochi | Fábio Protti Hybrid Metaheuristic for Bicluster Editing Problem Electronic Notes in Discrete Mathematics, 1 December 2012, Pages 35-42 4 Le Liu | Hong Zhou Applying Variable Neighborhood Search to the Single-machine Maximum Lateness Rescheduling Problem Electronic Notes in Discrete Mathematics, 1 December 2012, Pages 107-114 5 Tatjana Davidović | Teodor Gabriel Crainic MPI Parallelization of Variable Neighborhood Search Electronic Notes in Discrete Mathematics, 1 December 2012, Pages 241-248 6 Nenad Mladenović | Jozef Kratica | Vera Kovačević-Vujčić | Mirjana Čangalović Variable neighborhood search for the strong metric dimension problem Electronic Notes in Discrete Mathematics, 1 December 2012, Pages 51-57 7 Yiyong Xiao | Yun Tian | Qiuhong Zhao Discovering Frequent Itemset with Maximum Time-Window on Temporal Transaction Database using Variable Neighborhood Search Electronic Notes in Discrete Mathematics, 1 December 2012, Pages 137-144 8 Jack Brimberg | Zvi Drezner | Nenad Mladenovic | Said Salhi Generating good starting solutions for the p-median problem in the plane Electronic Notes in Discrete Mathematics, 1 December 2012, Pages 225-232 9 Nina Turajlić | Siniša Nešković Variable Neighborhood Search and Tabu Search for the Web Service Selection Problem Electronic Notes in Discrete Mathematics, 1 December 2012, Pages 177-184 10 Samir Loudni | Mathieu Fontaine | Patrice Boizumault Exploiting Separators for Guiding VNS Electronic Notes in Discrete Mathematics, 1 December 2012, Pages 265-272 - View all items

