Electronic Notes in Discrete Mathematics, Volume 36

Volume 36, August 2010

• Andréa Carneiro Linhares, Philippe Michelon, Dominique Feillet:
  An Exact Site Availability Approach to Modeling the D-FAP. 1-8
  
• Ana Maria de Almeida, Pedro Martins, Maurício C. de Souza:
  md-MST is NP-hard for d>=3. 9-15
  
• André César Medeiros, Sebastián Urrutia:
  Discrete optimization methods to determine trajectories for Dubins' vehicles. 17-24
  
• Firdovsi Sharifov, Hakan Kutucu:
  Minimum Cost <=k Edges Connected Subgraph Problems. 25-32
  
• Leonid Hulianytskyi, Sergii Sirenko:
  Cooperative model-based metaheuristics. 33-40
  
• Alain Quilliot, Mathieu Lacroix, Hélène Toussaint, Hervé Kerivin:
  Tree based heuristics for the preemptive asymmetric stacker crane problem. 41-48
  
• Alain Quilliot, Hélène Toussaint:
  Prospective Network Flow Models and Algorithms for Bin Packing Problems. 49-56
  
• Mette Gamst:
  Integrating job scheduling and constrained network routing. 57-64
  
• Cemalettin Öztürk, Semra Tunali, Brahim Hnich, Arslan M. Örnek:
  Simultaneous Balancing and Scheduling of Flexible Mixed Model Assembly Lines with Sequence-Dependent Setup Times. 65-72
  
• Mumtaz Ahmad:
  Expressing Polynomials as the Permanent of low rank Square Matrices. 73-80
  
• Giulia Galbiati, Stefano Gualandi, Francesco Maffioli:
  On Minimum Reload Cost Cycle Cover. 81-88
  
• Tiago Araújo Neves, Lúcia Maria de A. Drummond, Luiz Satoru Ochi, Célio Albuquerque, Eduardo Uchoa:
  Solving Replica Placement and Request Distribution in Content Distribution Networks. 89-96
  
• Abdel Lisser, Rafael Lopez:
  Stochastic Quadratic Knapsack with Recourse. 97-104
  
• Rainer E. Burkard, Behrooz Alizadeh:
  Inverse center location problems. 105-110
  
• Éric Gourdin:
  A Mixed Integer Model for the Sparsest Cut problem. 111-118
  
• Sergiu Carpov, Renaud Sirdey, Jacques Carlier, Dritan Nace:
  Speculative data prefetching for branching structures in dataflow programms. 119-126
  
• Ahmad-Saher Azizi-Sultan:
  Automatic Selection of Beam Orientations in Intensity-Modulated Radiation Therapy. 127-134
  
• Jochen Gorski, Luís Paquete:
  On a particular case of the multi-criteria unconstrained optimization problem. 135-142
  
• Mourad Baïou, Francisco Barahona, José R. Correa:
  On the p-median polytope of fork-free graphs. 143-149
  
• Melquíades Pérez Pérez, Francisco Almeida, J. M. Moreno Vega, Vicente Blanco Pérez, Adrián Santos:
  Exposing Metaheuristics as Web Services in Distributed Systems using OpenCF. 151-158
  
• Vicente Acuña, C. E. Ferreira, Alexandre S. Freire, Eduardo Moreno:
  The biclique k-clustering problem in bipartite graphs and its application in bioinformatics. 159-166
  
• Virginie Gabrel, Cécile Murat, Nabila Remli, Mathieu Lacroix:
  Recourse problem of the 2-stage robust location transportation problem. 167-174
  
• Luis Miguel Torres, Annegret Katrin Wagler:
  Model reconstruction for discrete deterministic systems. 175-182
  
• Eugenia Holm, Luis Miguel Torres, Annegret Katrin Wagler:
  On the Chvátal-rank of Antiwebs. 183-190
  
• Maria Ayala, Christian Artigues, Bernat Gacias:
  Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling. 191-198
  
• Arnaud Pêcher, Annegret Katrin Wagler:
  Clique and chromatic number of circular-perfect graphs. 199-206
  
• Ivana Ljubic, Stefan Gollowitzer:
  Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs. 207-214
  
• Roberto Montemanni, Valeria Leggieri:
  An exact algorithm for the Minimum Power Multicasting Problem in Wireless Sensor Networks. 215-222
  
• Valeria Leggieri, Mohamed Haouari, Chefi Triki:
  An Exact Algorithm for the Steiner Tree Problem with Delays. 223-230
  
• Mahfuza Sharmin, Rukhsana Yeasmin, Masud Hasan, Atif Rahman, Mohammad Sohel Rahman:
  Pancake Flipping with Two Spatulas. 231-238
  
• Frank Baumann, Christoph Buchheim:
  Submodular Formulations for Range Assignment Problems. 239-246
  
• Guillermo De Ita Luna, José Raymundo Marcial-Romero, Héctor A. Montes Venegas:
  Estimating the relevance on Communication Lines Based on the Number of Edge Covers. 247-254
  
• Christelle Caillouet, Stéphane Pérennes, Hervé Rivano:
  Cross line and column generation for the cut covering problem in wireless networks. 255-262
  
• Lucile Belgacem, Irène Charon, Olivier Hudry:
  A post-optimization method to route scheduled lightpath demands with multiplicity. 263-270
  
• Dominique Quadri, Éric Soutif:
  A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming. 271-278
  
• Roberto Quirino do Nascimento, Edson Figueiredo Lima Jr., Rubia Mara de Oliveira Santos:
  A Continuous Strategy to Solve a Class of Discrete Optimization Problems. 279-286
  
• Kenji Kashiwabara, Tadashi Sakuma:
  The positive circuits of oriented matroids with the packing property or idealness. 287-294
  
• Markus Leitner, Günther R. Raidl:
  Strong Lower Bounds for a Survivable Network Design Problem. 295-302
  
• Cem Evrendilek, Burkay Genç, Brahim Hnich:
  Covering oriented points in the plane with orthogonal polygons is NP-complete. 303-310
  
• Leonardo Conegundes Martinez, Alexandre Salles da Cunha:
  Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm. 311-318
  
• H. Murat Afsar:
  A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows. 319-326
  
• Cédric Joncour, Arnaud Pêcher:
  Consecutive ones matrices for multi-dimensional orthogonal packing problems. 327-334
  
• Péter Biró, Eric McDermid:
  Matching with sizes (or scheduling with processing set restrictions). 335-342
  
• Majid Salari, Zahra Naji Azimi, Paolo Toth:
  A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization. 343-350
  
• Juan José Miranda Bront, Isabel Méndez-Díaz, Paula Zabala:
  An integer programming approach for the time-dependent TSP. 351-358
  
• Anis Kooli, Mohamed Haouari, Lotfi Hidri, Emmanuel Néron:
  IP-Based Energetic Reasoning for the Resource Constrained Project Scheduling Problem. 359-366
  
• Mohamed Ali Aloulou, Mohamed Haouari, Farah Zeghal Mansour:
  Robust Aircraft Routing and Flight Retiming. 367-374
  
• Rafal Witkowski, Janez Zerovnik:
  1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs. 375-382
  
• Isabel Méndez-Díaz, Juan José Miranda Bront, Gustavo J. Vulcano, Paula Zabala:
  A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem. 383-390
  
• Vinícius G. P. de Sá, Celina M. Herrera de Figueiredo, Guilherme Dias da Fonseca, Raphael Machado:
  Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges. 391-398
  
• Jérôme Malick, Frédéric Roupin:
  Numerical Study of Semidefinite Bounds for the k-cluster Problem. 399-406
  
• Eduardo Moreno, Daniel G. Espinoza, Marcos Goycoolea:
  Large-scale multi-period precedence constrained knapsack problem: A mining application. 407-414
  
• Gábor Braun, Sebastian Pokutta:
  Rank of random half-integral polytopes - extended abstract -. 415-422
  
• Cédric Joncour, Arnaud Pêcher, Petru Valicov:
  MPQ-trees for orthogonal packing problem. 423-429
  
• Mitre Costa Dourado, Rosiane de Freitas Rodrigues, Jayme Luiz Szwarcfiter:
  Scheduling on parallel machines considering job-machine dependency constraints. 431-438
  
• Mhand Hifi, Hedi M'Halla:
  Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study. 439-446
  
• Fethi Jarray, Ghassen Tlig:
  A simulated annealing for reconstructing hv-convex binary matrices. 447-454
  
• Sourour Elloumi, Agnès Plateau:
  A computational study for the p-median Problem. 455-462
  
• János Barta, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki:
  Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem. 463-470
  
• Hemmak Allaoua, Ibrahim Osmane:
  Variable Parameters Lengths Genetic Algorithm for Minimizing Earliness-Tardiness Penalties of Single Machine Scheduling With a Common Due Date. 471-478
  
• Laurent Alfandari, Jérôme Monnot:
  Approximation of the Clustered Set Covering Problem. 479-485
  
• Tristram Gräbener, Alain Berro, Yves Duthen:
  Time dependent multiobjective best path for multimodal urban routing. 487-494
  
• Mohamed Haouari, Safa Bhar Layeb, Hanif D. Sherali:
  Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint. 495-502
  
• Manoel B. Campêlo, Ricardo C. Corrêa:
  A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems. 503-510
  
• Stefanie Kosuch, Abdel Lisser:
  Stochastic Shortest Path Problem with Delay Excess Penalty. 511-518
  
• Günter Schmidt, Esther Mohr, Mike Kersch:
  Experimental Analysis of an Online Trading Algorithm. 519-526
  
• Carlos Eduardo Ferreira, Christian Tjandraatmadja:
  A branch-and-cut approach to the repetition-free longest common subsequence problem. 527-534
  
• Dalila Boughaci:
  A Differential Evolution Algorithm for the Winner Determination Problem in Combinatorial Auctions. 535-542
  
• Makram Zaidi, Bassem Jarboui, Imed Kacem, Taïcir Loukil:
  Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines. 543-550
  
• Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini:
  The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems. 551-558
  
• Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini:
  The k-limited packing and k-tuple domination problems in strongly chordal, P₄-tidy and split graphs. 559-566
  
• Sara Nicoloso, Ugo Pietropaoli:
  Coloring Toeplitz graphs. 567-574
  
• Özgür Ülker, Dario Landa-Silva:
  A 0/1 Integer Programming Model for the Office Space Allocation Problem. 575-582
  
• Isabel Cristina Lopes, José M. Valério de Carvalho:
  An integer programming model for the Minimum Interval Graph Completion Problem. 583-590
  
• Chaya Losada, Maria Paola Scaparra, Richard L. Church:
  On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions. 591-598
  
• Svetlana Yaremchuk, Roman Burda, Oleg Morgalyuk:
  The minimax problem solving of physical fields sources allocation in specified positions. 599-606
  
• Melanie Schmidt, Martin Skutella:
  Earliest Arrival Flows in Networks with Multiple Sinks. 607-614
  
• G. Sauvanet, Emmanuel Néron:
  Search for the best compromise solution on Multiobjective shortest path problem. 615-622
  
• Alexandre Salles da Cunha, Laura Bahiense, Abilio Lucena, Cid Carvalho de Souza:
  A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem. 623-630
  
• Pablo A. Maya, Kenneth Sörensen, Peter Goos:
  An efficient metaheuristic to improve accessibility by rural road network planning. 631-638
  
• Guido Perboli, Roberto Tadei:
  New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem. 639-646
  
• Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König:
  Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks. 647-654
  
• Ervin Györi, Gyula Y. Katona, Nathan Lemons:
  Hypergraph Extensions of the Erdos-Gallai Theorem. 655-662
  
• Aziz Moukrim, K. Sghiouer, Corinne Lucet, Y. Li:
  Lower Bounds for the Minimal Sum Coloring Problem. 663-670
  
• Raphael C. S. Machado, Celina M. Herrera de Figueiredo:
  Total chromatic number of {square, unichord}-free graphs. 671-678
  
• Mustapha Bouhtou, Stéphane Gaubert, Guillaume Sagnol:
  Submodularity and Randomized rounding techniques for Optimal Experimental Design. 679-686
  
• Segla Kpodjedo, Philippe Galinier, Giuliano Antoniol:
  On the use of similarity metrics for approximate graph matching. 687-694
  
• C. Joncour, S. Michel, Ruslan Sadykov, D. Sverdlov, François Vanderbeck:
  Column Generation based Primal Heuristics. 695-702
  
• Giuseppe Bruno, Andrea Genovese:
  A Mathematical Model for the Optimization of the Airport Check-In Service Problem. 703-710
  
• Pei Wang, Gerhard Reinelt:
  A Heuristic for an Earth Observing Satellite Constellation Scheduling Problem with Download Considerations. 711-718
  
• Sangho Shim, Ellis L. Johnson, Wenwei Cao:
  Primal-dual simplex method for shooting. 719-726
  
• Marie-Claude Côté, Bernard Gendron, Louis-Martin Rousseau:
  Grammar-Based Integer Programming Models for Multi-Activity Shift Scheduling. 727-734
  
• Sarah Drewes, Sebastian Pokutta:
  Cutting-planes for weakly-coupled 0/1 second order cone programs. 735-742
  
• Alexander Engau, Miguel F. Anjos, Anthony Vannelli:
  An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization. 743-750
  
• Saoussen Krichen, Nadia Dahmani:
  A particle swarm optimization approach for the bi-objective load balancing problem. 751-758
  
• Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic:
  Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility. 759-766
  
• Monia Giandomenico, Fabrizio Rossi, Stefano Smriglio:
  Routing Concurrent Video Signals over SDH Networks. 767-774
  
• Matthias Walter, Jürgen Zimmermann:
  A heuristic approach to project staffing. 775-782
  
• Jörg Rambau, Konrad Schade:
  The Stochastic Guaranteed Service Model with Recourse for Multi-Echelon Warehouse Management. 783-790
  
• Abir Benabid, Claire Hanen:
  Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors. 791-798
  
• Matteo Fischetti, Andrea Lodi:
  On the knapsack closure of 0-1 Integer Linear Programs. 799-804
  
• Pietro Belotti, Andrew J. Miller, Mahdi Namazifar:
  Valid Inequalities and Convex Hulls for Multilinear Functions. 805-812
  
• Sophie Toulouse:
  Approximability of the Multiple Stack TSP. 813-820
  
• Wafa Karoui, Marie-José Huguet, Pierre Lopez, Mohamed Haouari:
  Climbing discrepancy search for flowshop and jobshop scheduling with time lags. 821-828
  
• Balázs Dezso, Alpár Jüttner, Péter Kovács:
  Column Generation Method for an Agent Scheduling Problem. 829-836
  
• Tamás Fleiner, András Frank:
  Balanced list edge-colourings of bipartite graphs. 837-842
  
• Alberto Caprara, Adam N. Letchford, Juan José Salazar González:
  Lower Bounds for the Minimum Linear Arrangement of a Graph. 843-849
  
• Mohamed Cheikh, Bassem Jarboui, Taïcir Loukil:
  A genetic algorithms to solve the bicriteria shortest path problem. 851-858
  
• Mohamed Kharbeche, Jacques Carlier, Mohamed Haouari, Aziz Moukrim:
  Exact Method for Robotic Cell Problem. 859-866
  
• Philippe Chrétienne, Pierre Fouilhoux, Éric Gourdin, Jean-Mathieu Segura:
  The Location-Dispatching Problem: polyhedral results and Content Delivery Network Design. 867-874
  
• Houda Derbel, Bassem Jarboui, Saïd Hanafi, Habib Chabchoub:
  An Iterated Local Search for Solving A Location-Routing Problem. 875-882
  
• Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic, Christophe Wilbaut, Igor Crévits:
  Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem. 883-890
  
• Mehdi Serairi, Mohamed Haouari:
  A Computational Study of Lower Bounds for the Two Dimensional Bin Packing Problem. 891-897
  
• Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub:
  On the complexity of the Eulerian closed walk with precedence path constraints problem. 899-906
  
• Viet Hung Nguyen, Thi Thu Thuy Nguyen:
  Approximating the asymmetric profitable tour. 907-914
  
• Hend Bouziri, Mouna Jouini:
  A tabu search approach for the sum coloring problem. 915-922
  
• Matthias Maischak, Andreas Krebs, Ernst P. Stephan:
  A quadratic programming problem arising from the p-version for obstacle problems. 923-930
  
• Nora Touati Moungla, Lucas Létocart, Anass Nagih:
  An improving dynamic programming algorithm to solve the shortest path problem with time windows. 931-938
  
• Samya Elaoud, Jacques Teghem, Taïcir Loukil:
  Multiple crossover genetic algorithm for the multiobjective traveling salesman problem. 939-946
  
• Anis Gharbi, Mohamed Naceur Azaiez, Mohamed Kharbeche:
  Minimizing Expected Attacking Cost in Networks. 947-954
  
• Denis Cornaz, Philippe Meurdesoif:
  The sandwich line graph. 955-960
  
• Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou:
  Networks with unicyclic connected components and without short cycles. 961-968
  
• Walid Ben-Ameur, Makhlouf Hadji:
  Steiner Networks with unicyclic connected components. 969-976
  
• Walid Ben-Ameur, Mohamed Didi Biha:
  Algorithms and formulations for the minimum cut separator problem. 977-983
  
• Luís Gouveia, Pedro Moura:
  Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations. 985-992
  
• Mhand Hifi, Imed Kacem, Stéphane Nègre, Lei Wu:
  A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem. 993-1000
  
• Luís Gouveia, Juan José Salazar González:
  On the Vehicle Routing Problem with lower bound capacities. 1001-1008
  
• Jean François Maurras, Thanh Hai Nguyen, Viet Hung Nguyen:
  On the Convex Hull of Huffman Trees. 1009-1016
  
• Rüdiger Stephan, Ingo Spiegelberg:
  On cardinality constrained polymatroids. 1017-1024
  
• Anna Galluccio, Claudio Gentile, Paolo Ventura:
  The stable set polytope of claw-free graphs with large stability number. 1025-1032
  
• Alexandre Lissy, Patrick Martineau:
  New scheduling problems coming from grid computing. 1033-1040
  
• Jakub Gladysz, Krzysztof Walkowiak:
  Combinatorial Optimization of Capacity and Flow Assignment Problem for Unicast and Anycast Connections with Linear and Convex Objective Functions - Exact and heuristic Algorithms. 1041-1048
  
• Maria Teresa Godinho, Luis Gouveia, Pierre Pesneau:
  Hop-indexed Circuit-based formulations for the Traveling Salesman Problem. 1049-1056
  
• Anis Gharbi, Mohamed Labidi:
  Extending the Single Machine-Based Relaxation Scheme for the Job Shop Scheduling Problem. 1057-1064
  
• Marta M. Casetti, Julian Merschen, Bernhard von Stengel:
  Finding Gale Strings. 1065-1072
  
• Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin:
  Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets. 1073-1080
  
• Silvia M. Bianchi, M. S. Montelar, Mariana S. Escalante:
  A comparison between lift-and-project indices and imperfection ratio on web graphs. 1081-1088
  
• Anis Gharbi, Talel Ladhari, Mohamed Kais Msakni, Mehdi Serairi:
  Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup Times. 1089-1096
  
• Dávid Szeszlér:
  Additive Approximation for Layer Minimization of Manhattan Switchbox Routing. 1097-1104
  
• Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pióro:
  Failure disjoint paths. 1105-1112
  
• Walid Ben-Ameur, Mateusz Zotkiewicz:
  Polynomial traffic demand polytope partitioning. 1113-1120
  
• Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
  Balancedness of some subclasses of circular-arc graphs. 1121-1128
  
• Yerim Chung, Jean-François Culus, Marc Demange:
  On Inverse Chromatic Number problems (Extended abstract). 1129-1136
  
• Johannes Hatzl:
  The 1-Median Problem in R^d with the Chebyshev-Norm and its Inverse Problem. 1137-1144
  
• Hassan Hijazi, Olivier Klopfenstein:
  Optimal routing for minimizing the maximal link congestion. 1145-1152
  
• Hassan Hijazi, Pierre Bonami, Gérard Cornuéjols, Adam Ouorou:
  Mixed Integer NonLinear Programs featuring "On/Off" constraints: convex analysis and applications. 1153-1160
  
• Gabriela R. Argiroffo, Maria E. Ugarte, Mariana S. Escalante:
  On the k-dominating set polytope of web graphs. 1161-1168
  
• Gabriela R. Argiroffo, Silvia M. Bianchi:
  Row family inequalities for the set covering polyhedron. 1169-1176
  
• Afef Bouzaiene, Najoua Dridi, Mohamed Ali Aloulou, Daniel Vanderpooten:
  A bicriteria flow-shop scheduling problem with two serial batching machines. 1177-1184
  
• Silvia M. Bianchi, Graciela L. Nasini, P. Tolomei:
  The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs. 1185-1192
  
• Djamal Rebaine:
  Scheduling flexible flowshops with unit-time operations and minimum time delays. 1193-1200
  
• Peter Laborczi, Balazs Mezny, Attila Török, Zoltán Ruzsa:
  Query-based Information Gathering in Intelligent Transportation Systems. 1201-1208
  
• Gábor Salamon:
  A Survey on Algorithms for the Maximum Internal Spanning Tree and Related Problems. 1209-1216
  
• Michel Minoux, Hacene Ouzia:
  Using DRL* relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut. 1217-1224
  
• Pablo Adasme, Abdel Lisser:
  Semidefinite and Conic Programming for Robust wireless OFDMA networks. 1225-1232
  
• Christian Artigues, Nicolas Jozefowiez, Mohamed Ali Aloulou:
  An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives. 1233-1240
  
• Mohammadreza Galavii:
  The inverse 1-median problem on a tree and on a path. 1241-1248
  
• Amaro de Sousa, Dorabella Santos, Pedro Matos, Joaquim Madeira:
  Load Balancing Optimization of Capacitated Networks with Path Protection. 1249-1256
  
• Jack Edmonds, Laura Sanità:
  On Finding Another Room-Partitioning of the Vertices. 1257-1264
  
• Tibor Szkaliczki, Michael Eberhard, Hermann Hellwagner, László Szobonya:
  Piece Selection Algorithm for Layered Video Streaming in P2P Networks. 1265-1272
  
• Jack Edmonds, Stéphane Gaubert, Vladimir Gurvich:
  Sperner Oiks. 1273-1280
  
• Jack Edmonds, Stéphane Gaubert, Vladimir Gurvich:
  Scarf Oiks. 1281-1288
  
• Jack Edmonds:
  Euler Complexes (Oiks). 1289-1293
  
• A. Bellanger, Ammar Oulamara, Mikhail Y. Kovalyov:
  Minimizing total completion time on a batching machine with job processing time compatibilities. 1295-1302
  
• Alberto Costa, Leo Liberti, Pierre Hansen:
  Formulation symmetries in circle packing. 1303-1310
  
• Leo Liberti, Stéphane Le Roux, Jeremy Leconte, Fabrizio Marinelli:
  Mathematical programming based debugging. 1311-1318
  
• Mohamed Hassan, Taha Landolsi, Khaled Assaleh, Husameldin Mukhtar:
  An Adaptive Scheduling Algorithm for Video Transmission over Wireless Packet Networks. 1319-1326
  

Last update Sat May 25 20:07:00 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page