dblp: Electronic Notes in Discrete Mathematics, Volume 13

Edoardo Amaldi, Antonio Capone, Federico Malucelli: Discrete models and algorithms for packet scheduling in smart antennas. 1-4

Stephan Dominique Andres: The Game Chromatic Index of Forests of Maximum Degree 5. 5-8

Armen S. Asratian, Natalia Oksimets: P_k+1-Decompositions of Eulerian Graphs: Complexity and Some Solvable Cases. 9-13

Pasquale Avella, Antonio Sassano, Igor Vasil'ev: A heuristic for large-scale p-median instances. 14-17

Paul S. Bonsma: The Complexity of the Matching-cut Problem for Various Graph Classes. 18-21

Sandro Bosio, Giovanni Righini: A combinatorial optimization problem arising from text classification. 22-25

A. Bumb, C. Hoede: The standard set game of a cooperative game. 26-29

Massimiliano Caramia, Stefano Giordani: A new graph model and heuristic algorithm for multi-mode task scheduling problem. 30-33

Márcia R. Cerioli: Clique Graphs and Edge-clique graphs. 34-37

Paolo Detti, Carlo Meloni: A channel state dependent scheduling in wireless communication systems. 38-40

Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda: m_Path Cover Saturated Graphs. 41-44

Thomas Epping, Winfried Hochstättler: Shortest paths through two-tone pairs. 45-48

Jutta Gebert, Martin Lätsch, Stefan Pickl, Gerhard-Wilhelm Weber, R. Wünschiers: Mathematical Modeling and Discrete Approximation in Evaluation and Forecasting of Expression-Data. 52-56

Harald Gropp: The (r, 1)-designs with 13 points. 57-60

Peter Lennartz: The Relation between the no-wait Job Shop Problem and the Traveling Salesman Problem. 61-63

Dmitrii Lozovanu, Stefan Pickl: Polynomial Time Algorithms for Determining Optimal Strategies. 64-68

Francesco Maffioli, Norma Zagaglia Salvi: On Some Properties of Base-matroids. 69-70

Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen: Performance Ratios for the Karmarkar-Karp Differencing Method. 71-75

Henry Martyn Mulder, Ladislav Nebesky: Signpost Systems and Their Underlying Graphs. 76-80

Tim Nieberg: Distributed Algorithms in Wireless Sensor Networks. 81-83

Stavros D. Nikolopoulos, Charis Papadopoulos: Counting Spanning Trees in Cographs. 84-92

Arnaud Pêcher, Annegret Wagler: On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four-Extended Abstract-. 93-96

Werner Poguntke: Using mincuts to design secret sharing schemes in graphs. 97-102

A. N. M. Salman, H. J. Broersma: The Ramsey Numbers of Paths Versus Fans. 103-107

Frederik Stork, Marc Uetz: Enumeration of Circuits and Minimal Forbidden Sets. 108-111

Hao Sun, Theo S. H. Driessen: A Individually Marginalistic Value for Set Games on Matroids. 112-116

A. Toni: Average Complexity of Addition Updates and Range Queries over an Array using Graphs. 117-122

Blaz Zmazek, Janez Zerovnik: On the Weak Reconstruction of Strong Product Graphs. 123-127

Electronic Notes in Discrete Mathematics, Volume 13