%{search_type} search results

• A Pre-processing Aware RINS Based MIP Heuristic / Thiago M. Gomes, Haroldo G. Santos, Marcone J.F. Souza
• A Hybrid Simulated Annealing Algorithm for Location of Cross-Docking Centers in a Supply Chain / S.M. Mousavi, R. Tavakkoli-Moghaddam, A. Siadat, B. Vahdani
• Intensification/Diversification in Decomposition Guided VNS / Samir Loudni, Mathieu Fontaine, Patrice Boizumault
• A Hybridized Particle Swarm Optimization with Expanding Neighborhood Topology for the Feature Selection Problem / Yannis Marinakis, Magdalene Marinaki
• Interleaving Constraint Propagation: An Efficient Cooperative Search with Branch and Bound / Eric Monfroy, Broderick Crawford, Ricardo Soto
• Automatic Tuning of GRASP with Evolutionary Path-Relinking / L.F. Morán-Mirabal, J.L. González-Velarde, M.G.C. Resende
• Combining Genetic Algorithm and Simulated Annealing Methods for Reconstructing HV-Convex Binary Matrices / Hadded Mohamed, Hasni Hamadi
• Experimental Analysis of Pheromone-Based Heuristic Column Generation Using irace / Florence Massen, Manuel López-Ibáñez, Thomas Stützle, Yves Deville
• A New Hybrid Metaheuristic -- Combining Stochastic Tunneling and Energy Landscape Paving / Kay Hamacher
• Workgroups Diversity Maximization: A Metaheuristic Approach / Marco Caserta, Stefan Voß
• Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations / Günther R. Raidl, Bin Hu, Marian Rainer-Harbach, Petrina Papazek
• Automatic Design of Hybrid Stochastic Local Search Algorithms / Marie-Eléonore Marmion, Franco Mascia, Manuel López-Ibáñez
• GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem / Johannes Inführ, Günther R. Raidl
• Hybrid Metaheuristics for the Far From Most String Problem / Daniele Ferone, Paola Festa, Mauricio G.C. Resende
• On Missing Data Hybridizations for Dimensionality Reduction / Oliver Kramer
• A Hybrid ACO+CP for Balancing Bicycle Sharing Systems / Luca Di Gaspero, Andrea Rendl, Tommaso Urli.

This book constitutes the refereed proceedings of the 8th International Workshop on Hybrid Metaheuristics, HM 2013, held in Ischia, Italy, in May 2013. The 16 revised full papers presented were carefully reviewed and selected from 30 submissions. The selected papers cover both theoretical and experimental results, including new paradigmatic hybrid solvers and automatic design approaches as well as applications to logistics and public transport.
(source: Nielsen Book Data)

• Hybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing Problem
• An ELSxPath Relinking Hybrid for the Periodic Location-Routing Problem
• Hybridizing Beam-ACO with Constraint Programming for Single Machine Job Scheduling
• Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows
• A Hybridization of Electromagnetic-Like Mechanism and Great Deluge for Examination Timetabling Problems
• Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem
• Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search
• Effective Hybrid Stochastic Local Search Algorithms for Biobjective Permutation Flowshop Scheduling
• Hierarchical Iterated Local Search for the Quadratic Assignment Problem
• Incorporating Tabu Search Principles into ACO Algorithms
• A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal?+?+?
• Multi-neighborhood Local Search for the Patient Admission Problem
• Matheuristics: Optimization, Simulation and Control.

This book constitutes the refereed proceedings of the 6th International Workshop on Hybrid Metaheuristics, HM 2009, held in Udine, Italy, in October 2009. The 12 revised full papers presented together with one invited talk were carefully reviewed and selected from 22 submissions. The papers discuss current issues of combinations of metaheuristics and other solving techniques of universal concern such as novel combinations of components from different metaheuristics, hybridization of metaheuristics and AI/OR techniques, low-level hybridization, high-level hybridization, portfolio techniques, expert systems, cooperative search, automated parameter tuning, empirical and statistical comparison, theoretical aspects of hybridization, parallelization, and software libraries.

• On the Structure of Reduced Kernel Lattice Bases / Karen Aardal, Frederik von Heymann
• All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns / Ron Adany, Moran Feldman, Elad Haramaty
• Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path / Aris Anagnostopoulos, Fabrizio Grandoni
• Intersection Cuts for Mixed Integer Conic Quadratic Sets / Kent Andersen, Anders Nedergaard Jensen
• Content Placement via the Exponential Potential Function Method / David Applegate, Aaron Archer
• Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case / Amitabh Basu, Robert Hildebrand
• Blocking Optimal Arborescences / Attila Bernáth, Gyula Pap
• Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property / Flavia Bonomo, Gianpaolo Oriolo
• A Complexity and Approximability Study of the Bilevel Knapsack Problem / Alberto Caprara, Margarida Carvalho
• Matroid and Knapsack Center Problems / Danny Z. Chen, Jian Li, Hongyu Liang.

• Cut-Generating Functions / Michele Conforti, Gérard Cornuéjols
• Reverse Chvátal-Gomory Rank / Michele Conforti, Alberto Del Pia
• On Some Generalizations of the Split Closure / Sanjeeb Dash, Oktay Günlük
• Packing Interdiction and Partial Covering Problems / Michael Dinitz, Anupam Gupta
• On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators / Hongbo Dong, Jeff Linderoth
• An Improved Integrality Gap for Asymmetric TSP Paths / Zachary Friggstad, Anupam Gupta, Mohit Singh
• Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids / Bertrand Guenin, Leanne Stuive
• A Stochastic Probing Problem with Applications / Anupam Gupta, Viswanath Nagarajan
• Thrifty Algorithms for Multistage Robust Optimization / Anupam Gupta, Viswanath Nagarajan
• Shallow-Light Steiner Arborescences with Vertex Delays / Stephan Held, Daniel Rotter
• Two Dimensional Optimal Mechanism Design for a Sequencing Problem / Ruben Hoeksma, Marc Uetz.

• Advances on Matroid Secretary Problems: Free Order Model and Laminar Case / Patrick Jaillet, José A. Soto
• A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets / Diego Alejandro Morán Ramírez
• The Complexity of Scheduling for p-Norms of Flow and Stretch / Benjamin Moseley, Kirk Pruhs, Cliff Stein
• The Euclidean k-Supplier Problem / Viswanath Nagarajan, Baruch Schieber
• Facial Structure and Representation of Integer Hulls of Convex Sets / Vishnu Narayanan
• An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem / Tim Nonner, Maxim Sviridenko
• Chain-Constrained Spanning Trees / Neil Olver, Rico Zenklusen
• A Simpler Proof for O(Congestion+Dilation) Packet Routing / Thomas Rothvoß
• 0/1 Polytopes with Quadratic Chvátal Rank / Thomas Rothvoß, Laura Sanitá
• Eight-Fifth Approximation for the Path TSP / András Sebő
• Fast Deterministic Algorithms for Matrix Completion Problems / Tasuku Soma
• Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines / Maxim Sviridenko, Andreas Wiese.

This book constitutes the proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2013, held in Valparaíso, Chile, in March 2013. The 33 full papers presented were carefully reviewed and selected from 98 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization with the aim to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

• Invited Talks.- Why Are String Graphs So Beautiful?.- The Art of Cheating When Drawing a Graph.- Papers.- Drawing Hamiltonian Cycles with No Large Angles.- Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings.- On the Perspectives Opened by Right Angle Crossing Drawings.- Drawing 3-Polytopes with Good Vertex Resolution.- Planar Drawings of Higher-Genus Graphs.- Splitting Clusters to Get C-Planarity.- On the Characterization of Level Planar Trees by Minimal Patterns.- Characterization of Unlabeled Radial Level Planar Graphs.- Upward Planarization Layout.- More Flexible Radial Layout.- WiGis: A Framework for Scalable Web-Based Interactive Graph Visualizations.- Port Constraints in Hierarchical Layout of Data Flow Diagrams.- Fast Edge-Routing for Large Graphs.- Leftist Canonical Ordering.- Succinct Greedy Drawings Do Not Always Exist.- Geometric Simultaneous Embeddings of a Graph and a Matching.- Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs.- Removing Independently Even Crossings.- Manhattan-Geodesic Embedding of Planar Graphs.- Orthogonal Connector Routing.- On Rectilinear Drawing of Graphs.- Semi-bipartite Graph Visualization for Gene Ontology Networks.- On Open Problems in Biological Network Visualization.- A Novel Grid-Based Visualization Approach for Metabolic Networks with Advanced Focus&Context View.- Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs.- Drawing Trees in a Streaming Model.- The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree.- Drawing Planar 3-Trees with Given Face-Areas.- 3D Visibility Representations by Regular Polygons.- Complexity of Some Geometric and Topological Problems.- On Planar Supports for Hypergraphs.- DAGmaps and ?-Visibility Representations of DAGs.- Drawing Directed Graphs Clockwise.- An Improved Algorithm for the Metro-line Crossing Minimization Problem.- Layout with Circular and Other Non-linear Constraints Using Procrustes Projection.- Posters.- GMap: Drawing Graphs as Maps.- Using High Dimensions to Compare Drawings of Graphs.- On ?-Constrained Upward Topological Book Embeddings.- 4-Labelings and Grid Embeddings of Plane Quadrangulations.- IBM ILOG Graph Layout for Eclipse.- Layout Techniques Coupled with Web2.0-Based Business Process Modeling.- Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles.- Visualization of Complex BPEL Models.- DAGmaps and Dominance Relationships.- Scaffold Hunter - Interactive Exploration of Chemical Space.- Graph Drawing Contest.- Graph Drawing Contest Report.
• (source: Nielsen Book Data)

The 17th International Symposium on Graph Drawing (GD 2009) was held in Chicago, USA, September 22-25, 2009, and was attended by 91 participants from 19 countries. In response to the call for papers, the Program Committee received 79 s- missions. Each submission was reviewed by at least three Program Committee members. Following substantial discussions, the committee accepted 31 long - pers and 4 short papers. All authors received detailed reviewers' comments. In a separate submission process, 10 posters were accepted. These were described during the conference, and displayedatthe conferencesite. Eachposter was also granted a two-page description in the conference proceedings. Two invited speakers, J' anos Pach from EPFL Lausanne and R' eny Institute, and Martin Wattenberg from IBM Research, gave absorbing talks during the conference. Prof. Pach looked at the class of string graphs, and tantalized us to consider why their properties are so mathematically beautiful. Dr. Watt- berg showed how sometimes twisting the standard rules of graph drawing can illuminate unexpected information contained in graphs. Keepingwithtradition, the symposiumhostedthe 15thAnnualGraphDr- ingContest, including aGraphDrawingChallengeforconferenceattendees.The contest elicited robust participation from the community with 27 submissions. These proceedings end with a detailed report of the contest. As always, the success of a conference such as this relies on the help of many people. Our thanks to the Program Committee and all of the external referees who worked so hard to sift for the best among the submitted papers. The OrganizingCommittee providedus with admirablefacilities, a ?ne banquet, andtookcareofsomanyotherdetailsthatitwashardtobelievetherewereon ly threemembers:Jennifer McClelland, MichaelJ.PelsmajerandMarcusSchaefer.
(source: Nielsen Book Data)

• Invited Talks.- Why Are String Graphs So Beautiful?.- The Art of Cheating When Drawing a Graph.- Papers.- Drawing Hamiltonian Cycles with No Large Angles.- Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings.- On the Perspectives Opened by Right Angle Crossing Drawings.- Drawing 3-Polytopes with Good Vertex Resolution.- Planar Drawings of Higher-Genus Graphs.- Splitting Clusters to Get C-Planarity.- On the Characterization of Level Planar Trees by Minimal Patterns.- Characterization of Unlabeled Radial Level Planar Graphs.- Upward Planarization Layout.- More Flexible Radial Layout.- WiGis: A Framework for Scalable Web-Based Interactive Graph Visualizations.- Port Constraints in Hierarchical Layout of Data Flow Diagrams.- Fast Edge-Routing for Large Graphs.- Leftist Canonical Ordering.- Succinct Greedy Drawings Do Not Always Exist.- Geometric Simultaneous Embeddings of a Graph and a Matching.- Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs.- Removing Independently Even Crossings.- Manhattan-Geodesic Embedding of Planar Graphs.- Orthogonal Connector Routing.- On Rectilinear Drawing of Graphs.- Semi-bipartite Graph Visualization for Gene Ontology Networks.- On Open Problems in Biological Network Visualization.- A Novel Grid-Based Visualization Approach for Metabolic Networks with Advanced Focus&Context View.- Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs.- Drawing Trees in a Streaming Model.- The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree.- Drawing Planar 3-Trees with Given Face-Areas.- 3D Visibility Representations by Regular Polygons.- Complexity of Some Geometric and Topological Problems.- On Planar Supports for Hypergraphs.- DAGmaps and ?-Visibility Representations of DAGs.- Drawing Directed Graphs Clockwise.- An Improved Algorithm for the Metro-line Crossing Minimization Problem.- Layout with Circular and Other Non-linear Constraints Using Procrustes Projection.- Posters.- GMap: Drawing Graphs as Maps.- Using High Dimensions to Compare Drawings of Graphs.- On ?-Constrained Upward Topological Book Embeddings.- 4-Labelings and Grid Embeddings of Plane Quadrangulations.- IBM ILOG Graph Layout for Eclipse.- Layout Techniques Coupled with Web2.0-Based Business Process Modeling.- Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles.- Visualization of Complex BPEL Models.- DAGmaps and Dominance Relationships.- Scaffold Hunter - Interactive Exploration of Chemical Space.- Graph Drawing Contest.- Graph Drawing Contest Report.
• (source: Nielsen Book Data)

The 17th International Symposium on Graph Drawing (GD 2009) was held in Chicago, USA, September 22-25, 2009, and was attended by 91 participants from 19 countries. In response to the call for papers, the Program Committee received 79 s- missions. Each submission was reviewed by at least three Program Committee members. Following substantial discussions, the committee accepted 31 long - pers and 4 short papers. All authors received detailed reviewers' comments. In a separate submission process, 10 posters were accepted. These were described during the conference, and displayedatthe conferencesite. Eachposter was also granted a two-page description in the conference proceedings. Two invited speakers, J' anos Pach from EPFL Lausanne and R' eny Institute, and Martin Wattenberg from IBM Research, gave absorbing talks during the conference. Prof. Pach looked at the class of string graphs, and tantalized us to consider why their properties are so mathematically beautiful. Dr. Watt- berg showed how sometimes twisting the standard rules of graph drawing can illuminate unexpected information contained in graphs. Keepingwithtradition, the symposiumhostedthe 15thAnnualGraphDr- ingContest, including aGraphDrawingChallengeforconferenceattendees.The contest elicited robust participation from the community with 27 submissions. These proceedings end with a detailed report of the contest. As always, the success of a conference such as this relies on the help of many people. Our thanks to the Program Committee and all of the external referees who worked so hard to sift for the best among the submitted papers. The OrganizingCommittee providedus with admirablefacilities, a ?ne banquet, andtookcareofsomanyotherdetailsthatitwashardtobelievetherewereon ly threemembers:Jennifer McClelland, MichaelJ.PelsmajerandMarcusSchaefer.
(source: Nielsen Book Data)

• Invited Papers.- Scenario Reduction Techniques in Stochastic Programming.- Statistical Learning of Probabilistic BDDs.- Regular Contributions.- Learning Volatility of Discrete Time Series Using Prediction with Expert Advice.- Prediction of Long-Range Dependent Time Series Data with Performance Guarantee.- Bipartite Graph Representation of Multiple Decision Table Classifiers.- Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies.- On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance.- A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems.- How to Design a Linear Cover Time Random Walk on a Finite Graph.- Propagation Connectivity of Random Hypergraphs.- Graph Embedding through Random Walk for Shortest Paths Problems.- Relational Properties Expressible with One Universal Quantifier Are Testable.- Theoretical Analysis of Local Search in Software Testing.- Firefly Algorithms for Multimodal Optimization.- Economical Caching with Stochastic Prices.- Markov Modelling of Mitochondrial BAK Activation Kinetics during Apoptosis.- Stochastic Dynamics of Logistic Tumor Growth.
• (source: Nielsen Book Data)

The 5th Symposium on Stochastic Algorithms, Foundations and Applications (SAGA 2009) took place during October 26-28, 2009, at Hokkaido University, Sapporo(Japan).ThesymposiumwasorganizedbytheDivisionofComputerS- ence, GraduateSchoolofComputerScienceandTechnology, HokkaidoUniversity. It o?ered the opportunity to present original research on the design and analysis of randomized algorithms, random combinatorialstructures, implem- tation, experimental evaluation and real-world application of stochastic al- rithms/heuristics. In particular, the focus of the SAGA symposia series is on investigating the power of randomization in algorithms, and on the theory of stochastic processes especially within realistic scenarios and applications. Thus, the scope ofthe symposiumrangesfromthe study oftheoreticalfundamentals of randomizedcomputationtoexperimentalinvestigationsonalgorithms/he uristics and related stochastic processes. The SAGA symposium series is a biennial meeting. Previous SAGA s- posiatookplaceinBerlin, Germany(2001, LNCSvol.2264), Hat?eld, UK(2003, LNCS vol. 2827), Moscow, Russia (2005, LNCS vol. 3777), and Zur .. ich, Switz- land (2007, LNCS vol. 4665). This year 22 submissions were received, and the Program Committee selected 15 submissions for presentation. All papers were evaluated by at least three members of the ProgramCommittee, partly with the assistance of subreferees. The present volume contains the texts of the 15 papers presented at SAGA 2009, divided into groups of papers on learning, graphs, testing, optimization, and caching as well as on stochastic algorithms in bioinformatics.
(source: Nielsen Book Data)

This book constitutes the thoroughly refereed post-conference proceedings of the 15th International Symposium on Graph Drawing, GD 2007, held in Sydney, Australia, September 24-26, 2007. The 27 full papers and 9 short papers presented together with 2 invited talks, and a report on the graph drawing contest were carefully selected from 74 initial submissions. All current aspects in graph drawing are addressed ranging from foundational and methodological issues to applications for various classes of graphs in a variety of fields.
(source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 5th International Workshop on Hybrid Metaheuristics, HM 2008, held in Dortmund, Germany, in October 2008. The 14 revised full papers presented were carefully reviewed and selected from 33 submissions. The papers discuss specific aspects of combinations of metaheuristics and other solving techniques for tackling particular relevant constrained optimization problems, such as fiber optic networks, time tabling and freight train scheduling problems.
(source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 13th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2008, held in Bertinoro, Italy, in May 2008. The 32 revised full papers presented were carefully reviewed and selected from 95 submissions. The papers cover various aspects of integer programming and combinatorial optimization and present recent developments in theory, computation, and applications in that area. Topics included are such as approximation algorithms, branch and bound algorithms, branch and cut algorithms, computational biology, computational complexity, computational geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, on-line algorithms and competitive analysis, polyhedral combinatorics, randomized algorithms, random graphs, scheduling theory and scheduling algorithms, and semidefinite programs.
(source: Nielsen Book Data)

• Evolutionary Local Search for the Super-Peer Selection Problem and the p-Hub Median Problem.- An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem.- Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems.- Guiding ACO by Problem Relaxation: A Case Study on the Symmetric TSP.- Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem.- Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop.- A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy.- On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case.- Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement.- Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge.- Gradient-Based/Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric.- A Hybrid VNS for Connected Facility Location.- A Memetic Algorithm for the Optimum Communication Spanning Tree Problem.- Hybrid Numerical Optimization for Combinatorial Network Problems.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 4th International Workshop on Hybrid Metaheuristics, HM 2007, held in Dortmund, Germany. The 14 revised full papers discuss specific aspects of hybridization of metaheuristics, hybrid metaheuristics design, development and testing. With increasing attention to methodological aspects, from both the empirical and theoretical sides, the papers show a representative sample of research in the field of hybrid metaheuristics.
(source: Nielsen Book Data)

• Retrial Queues
• Controllable Queues
• Strategic Queues
• Queueing Networks
• Scheduling Policies
• Multidimensional Systems
• Queueing Models in Applications.

This book constitutes the proceedings of the 14th International Conference on Queueing Theory and Network Applications, QTNA 2019, held in Ghent, Belgium, in August 2019. The 23 full papers included in this volume were carefully reviewed and selected from 49 initial submissions. The papers are organized in topical sections on Retrial Queues; Controllable Queues; Strategic Queues; Queueing Networks; Scheduling Policies; Multidimensional Systems; and Queueing Models in Applications.

• Queueing Models with Retrials.- Queueing Models with Variants of Service.- Queueing Models for Cloud Computing.- Queueing Models for Wireless Communication.- Optimization in Queueing Models.
• (source: Nielsen Book Data)

This book constitutes the proceedings of the 13th International Conference on Queueing Theory and Network Applications, QTNA 2018, held in Tsukuba, Japan in July 2018.The 8 full papers together with 10 short papers included in this volume were carefully reviewed and selected from 57 initial submissions. All the papers to be presented disseminate the latest results covering up-to-date research fields such as performance modeling and analysis of telecommunication systems, retrial and vacation queueing models, optimization of queueing systems, modeling of social systems, application of machine learning in queueing models.
(source: Nielsen Book Data)

• Upward Drawings. On the Upward Planarity of Mixed Plane Graphs / Fabrizio Frati [and others]
• Upward Planarity Testing: A Computational Study / Markus Chimani, Robert Zeranski
• Planarity. Characterizing Planarity by the Splittable Deque / Christopher Auer [and others]
• Strip Planarity Testing / Patrizio Angelini [and others]
• Morphing Planar Graph Drawings Efficiently / Patrizio Angelini [and others]
• Invited Talk. Graph Drawing through the Lens of a Framework for Analyzing Visualization Methods / Tamara Munzner
• Beyond Planarity. A Linear-Time Algorithm for Testing Outer-1-Planarity / Seok-Hee Hong [and others]
• Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs / Md. Jawaherul Alam, Franz J. Brandenburg, Stephen G. Kobourov
• New Bounds on the Maximum Number of Edges in k-Quasi-Planar Graphs / Andrew Suk, Bartosz Walczak
• Recognizing Outer 1-Planar Graphs in Linear Time / Christopher Auer [and others]
• Geometric Representations. Straight Line Triangle Representations / Nieke Aerts, Stefan Felsner.

• Extending Partial Representations of Circle Graphs / Steven Chaplick, Radoslav Fulek, Pavel Klavík
• On Balanced -Contact Representations / Stephane Durocher, Debajyoti Mondal
• Strongly-Connected Outerplanar Graphs with Proper Touching Triangle Representations / J. Joseph Fowler
• 3D et al. Achieving Good Angular Resolution in 3D Arc Diagrams / Michael T. Goodrich, Paweł Pszona
• A Duality Transform for Constructing Small Grid Embeddings of 3D Polytopes / Alexander Igamberdiev, André Schulz
• Block Additivity of Z2-Embeddings / Marcus Schaefer, Daniel Štefankovič
• Universality. Exploiting Air-Pressure to Map Floorplans on Point Sets / Stefan Felsner
• Superpatterns and Universal Point Sets / Michael J. Bannister [and others]
• Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices / Thomas Bläsius, Annette Karrer, Ignaz Rutter
• Practical Graph Drawing. Sketched Graph Drawing: A Lesson in Empirical Studies / Helen C. Purchase
• Many-to-One Boundary Labeling with Backbones / Michael A. Bekos [and others].

• Streamed Graph Drawing and the File Maintenance Problem / Michael T. Goodrich, Paweł Pszona
• COAST: A Convex Optimization Approach to Stress-Based Embedding / Emden R. Gansner, Yifan Hu, Shankar Krishnan / Subgraphs. Colored Spanning Graphs for Set Visualization / Ferran Hurtado [and others]
• Drawing Non-Planar Graphs with Crossing-Free Subgraphs / Patrizio Angelini [and others]
• Exploring Complex Drawings via Edge Stratification / Emilio Di Giacomo [and others]
• Drawing Planar Graphs with a Prescribed Inner Face / Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter
• Crossings. Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases / Martin Fink, Sergey Pupyrev
• Fixed Parameter Tractability of Crossing Minimization of Almost-Trees / Michael J. Bannister, David Eppstein, Joseph A. Simons
• Strict Confluent Drawing / David Eppstein [and others] / Geometric Graphs and Geographic Networks. A Ramsey-Type Result for Geometric ℓ-Hypergraphs / Dhruv Mubayi, Andrew Suk
• Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations / Timothy M. Chan [and others].

• Stub Bundling and Confluent Spirals for Geographic Networks / Arlind Nocaj, Ulrik Brandes
• Angular Restrictions. On Orthogonally Convex Drawings of Plane Graphs / Yi-Jun Chang, Hsu-Chun Yen
• Planar and Plane Slope Number of Partial 2-Trees / William Lenhart [and others]
• Slanted Orthogonal Drawings / Michael A. Bekos [and others]
• Grids. Drawing Arrangement Graphs in Small Grids, or How to Play Planarity / David Eppstein
• Incremental Grid-Like Layout Using Soft and Hard Constraints / Steve Kieffer [and others]
• Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings / Therese Biedl [and others]
• Curves and Routes. Untangling Two Systems of Noncrossing Curves / Jiří Matoušek [and others]
• Drawing Permutations with Few Corners / Sergey Bereg [and others]
• Dynamic Traceroute Visualization at Multiple Abstraction Levels / Massimo Candela [and others]
• Graph Drawing Contest. Graph Drawing Contest Report / Christian A. Duncan [and others].

• Session I: Upward Drawings
• On the Upward Planarity of Mixed Plane Graphs
• Upward Planarity Testing: A Computational Study
• Session II: Planarity
• Characterizing Planarity by the Splittable Deque
• Strip Planarity Testing
• Morphing Planar Graph Drawings Efficiently
• Invited Talk I
• Graph Drawing through the Lens of a Framework for Analyzing Visualization Methods (Invited Talk, Extended Abstract)
• Session III: Beyond Planarity
• A Linear-Time Algorithm for Testing Outer-1-Planarity.-Straight-Line Grid Drawings of 3-Connected 1- Planar Graphs .-New Bounds on the Maximum Number of Edges in k-Quasi-Planar Graphs
• Recognizing Outer 1-Planar Graphs in Linear Time
• Session IV: Geometric Representations
• Straight Line Triangle Representations
• Extending Partial Representations of Circle Graphs
• On Balanced ✛-Contact Representations
• Strongly-Connected Outerplanar Graphs with Proper Touching Triangle Representations
• Session V: 3D et al
• Achieving Good Angular Resolution in 3D Arc Diagrams
• A Duality Transform for Constructing Small Grid Embeddings of 3D.-Polytopes
• Block Additivity of Z2-Embeddings
• Session VI: Universality
• Exploiting Air-Pressure to Map Floorplans on Point Sets
• Superpatterns and Universal Point Sets
• Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices
• Session VII: Practical Graph Drawing
• Sketched Graph Drawing: A Lesson in Empirical Studies
• Many-to-One Boundary Labeling with Backbones
• Streamed Graph Drawing and the File Maintenance Problem
• COAST: A Convex Optimization Approach to Stress-Based Embedding
• Session VIII: Subgraphs
• Colored Spanning Graphs for Set Visualization
• Drawing Non-planar Graphs with Crossing-Free Subgrap
• Exploring Complex Drawings via Edge Stratification
• Drawing Planar Graphs with a Prescribed Inner Face
• Session IX: Crossings
• Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases
• Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
• Strict Confluent Drawing
• Session X: Geometric Graphs and Geographic Networks
• A Ramsey-Type Result for Geometric -hypergraphs
• Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations
• Stub Bundling and Confluent Spirals for Geographic Networks
• Session XI: Angular Restrictions
• On Orthogonally Convex Drawings of Plane Graphs (Extended Abstract)
• Planar and Plane Slope Number of Partial 2-Trees
• Slanted Orthogonal Drawings
• Session XII: Grids
• Drawing Arrangement Graphs in Small Grids, or How to Play Planarity
• Incremental Grid-like Layout Using Soft and Hard Constraints
• Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings
• Session XIII: Curves and Routes
• Untangling Two Systems of Noncrossing Curves
• Drawing Permutations with Few Corners
• Dynamic Traceroute Visualization at Multiple Abstraction Levels
• Graph Drawing Contest
• Graph Drawing Contest Report
• Posters
• 3D Graph Printing in GLuskap
• Optical Graph Recognition on a Mobile Device
• Browser-Based Graph Visualization of Dynamic Data with VisGraph
• Exact and Fixed-Parameter Algorithms for Metro-Line Crossing Minimization Problems.-Convex-Arc Drawings of Pseudolines
• The Density of Classes of 1-Planar Graphs
• BGPlay3D: Exploiting the Ribbon Representation to Show the Evolution of Interdomain Routing
• Ravenbrook Chart: A New Library for Graph Layout and Visualisation
• Small Grid Embeddings of Prismatoids and the Platonic Solids
• The Graph Landscape
• a Visualization of Graph Properties
• Application of Graph Layout Algorithms for the Visualization of Biological Networks in 3D.-Plane Cubic Graphs and the Air-Pressure Method.

This book constitutes the thoroughly refereed post-conference proceedings of the 21st International Symposium on Graph Drawing, GD 2013, held in Bordeaux, France, in September 2013. The 42 revised full papers presented together with 12 revised short papers, 3 invited talks and 1 poster description were carefully reviewed and selected from 110 submissions. The papers are organized in topical sections on upward drawings, planarity, beyond planarity, geometric representations, 3D et al., universality, practical graph drawing, subgraphs, crossings, geometric graphs and geographic networks, angular restrictions, grids, curves and routes. The book also contains a short description of the graph drawing contest.

This volume constitutes the refereed proceedings of the 19th International Symposium on Graph Drawing, GD 2010, held in Eindhoven, The Netherlands, during September 2011. The 34 revised full papers presented together with 3 revised short and 6 poster papers were carefully reviewed and selected from 88 submissions. Furthermore, the proceedings contain the abstracts of two invited talks and to commemorate Kozo Sugiyama and his pioneering research in graph drawing, the proceedings include an obituary. A unique and fun part of the symposium is the Graph Drawing Contest, which is part of the Graph Drawing Challenge. This year was the 18th edition. A report on the contest is included at the end of the proceedings.
(source: Nielsen Book Data)

• Intro
• Title
• Preface
• Organization
• Table of Contents
• Parallel Computing
• Towards Energy Efficient Parallel Computing on Consumer Electronic Devices
• Introduction
• ARM Computing
• The AppleTV Cluster
• Evaluation
• Single Node
• Whole System
• Related Work
• Outlook and Conclusion
• References
• Characterizing Applications from Power Consumption: A Case Study for HPC Benchmarks
• Introduction and Motivation
• State of the Art
• Our Approach
• Validation
• Experimental Method
• Experimental Results
• Conclusion
• References

• Principles of Energy Efficiency in High Performance Computing
• Introduction
• Tools for Energy Monitoring and Control
• Site Infrastructure Aspects
• System Hardware and Operation Requirements
• Conclusions
• References
• ICT for Transportation
• Geocast Routing in Vehicular Networks for Reduction of CO_2 Emissions
• Introduction
• Related Work
• Geocast Protocols to Minimize Message Latency
• Geocast Protocols to Increase the Dissemination Reliability
• Geocast Protocols Aim to Reduce Fuel Consumption and Emissions
• System Model

• Proposed Environmentally Friendly Geocast Protocol
• Defining the Geocast Destination Regions or ROI
• Message Delivery
• From a TLS to Vehicles
• Inter-vehicle Communication
• From Vehicles to a TLS
• Simulation Study and Discussions
• Conclusions and Future Work
• References
• Limiting Pollution in Ground Control Optimization
• Introduction
• Problem Description
• Problem Constraints
• The Alternative Graph Model
• Conflicts Models
• Heuristics
• Computational Experiments
• Conclusion
• References

• A Simulation Environment for Smart Charging of Electric Vehicles Using a Multi-objective Evolutionary Algorithm
• Introduction
• Related Work
• Problem Definition
• Hard Constraints
• Optimization Objectives
• A Simulation Environment for Smart Charging
• Simulation Environment Properties
• Optimization Algorithm
• Conclusion and Future Work
• References
• Cloud Computing
• Furthering the Growth of Cloud Computing by Providing Privacy as a Service
• Introduction
• Cloud Computing Growth
• Current Reasons for Growth
• Future Growth and the Public Sector
• Privacy

• Definition of Privacy
• Private Information
• Extending the SLA with Privacy
• Developing Privacy Constraints
• Privacy Quality of Service Levels
• Monitoring and Legislation
• Monitoring Privacy with Privacy as a Service
• Legislation and the Public Sector
• Related Work
• Conclusions and Future Work
• References
• The Concept of a Mobile Cloud Computing to Reduce Energy Cost of Smartphones and ICT Systems
• Introduction
• System Model
• Energy Cost Evaluation
• Download from the CC Data Center
• Download from the MCC Data Center
• Performance Evaluation
• Conclusion

This book constitutes the refereed proceedings of the First International Conference on Information and Communication Technology for the Fight against Global Warming, ICT-Glow 2011, held in Toulouse, France in August 2011. The 16 revised papers presented were carefully reviewed and selected from 24 submissions. They address the following topics: parallel computing, ICT for transportation, cloud and pervasive computing, measurement and control and storage.
(source: Nielsen Book Data)

• Evolutionary Local Search for the Super-Peer Selection Problem and the p-Hub Median Problem.- An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem.- Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems.- Guiding ACO by Problem Relaxation: A Case Study on the Symmetric TSP.- Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem.- Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop.- A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy.- On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case.- Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement.- Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge.- Gradient-Based/Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric.- A Hybrid VNS for Connected Facility Location.- A Memetic Algorithm for the Optimum Communication Spanning Tree Problem.- Hybrid Numerical Optimization for Combinatorial Network Problems.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 4th International Workshop on Hybrid Metaheuristics, HM 2007, held in Dortmund, Germany. The 14 revised full papers discuss specific aspects of hybridization of metaheuristics, hybrid metaheuristics design, development and testing. With increasing attention to methodological aspects, from both the empirical and theoretical sides, the papers show a representative sample of research in the field of hybrid metaheuristics.
(source: Nielsen Book Data)