000			00338nam a2200109Ia 4500
999			_c192811 _d192811
020			_a978-3-319-21840-3
040			_cDepartment of Computer Applications
100			_aDehne
245		0	_aAlgorithms and Data Structures/
260			_aNew York: _bSpringer,
505			_a Contact Graphs of Circular Arcs Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz et al. Contact Representations of Graphs in 3D Jawaherul Alam, William Evans, Stephen Kobourov, Sergey Pupyrev, Jackson Toeniskoetter, Torsten Ueckerdt Minimizing the Aggregate Movements for Interval Coverage Aaron M. Andrews, Haitao Wang Online Bin Packing with Advice of Small Size Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc Renault, Adi Rosén On the Approximability of Orthogonal Order Preserving Layout Adjustment Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi Varadarajan An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel Smid Generation of Colourings and Distinguishing Colourings of Graphs William Bird, Wendy Myrvold Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen On Conflict-Free Multi-coloring Andreas Bärtschi, Fabrizio Grandoni Semi-dynamic Connectivity in the Plane Sergio Cabello, Michael Kerber Interval Selection in the Streaming Model Sergio Cabello, Pablo Pérez-Lantero On the Bounded-Hop Range Assignment Problem Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi Greedy Is an Almost Optimal Deque Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak A New Approach for Contact Graph Representations and Its Applications Yi-Jun Chang, Hsu-Chun Yen Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm Jianer Chen, Chao Xu, Jianxin Wang Select with Groups of 3 or 4 Ke Chen, Adrian Dumitrescu Approximating Nearest Neighbor Distances Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs Christophe Crespelle, Tien-Nam Le, Kevin Perrot, Thi Ha Duong Phan On the Complexity of an Unregulated Traffic Crossing Philip Dasler, David M. Mount Finding Pairwise Intersections Inside a Query Range Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi Cache-Oblivious Iterated Predecessor Queries via Range Coalescing Erik D. Demaine, Vineet Gopal, William Hasenplaugh Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing Erik D. Demaine, Tim Kaler, Quanquan Liu, Aaron Sidford, Adam Yedidia On the Minimum Eccentricity Shortest Path Problem Feodor F. Dragan, Arne Leitert Convex Polygons in Geometric Triangulations Adrian Dumitrescu, Csaba D. Tóth Straight-Line Drawability of a Planar Graph Plus an Edge Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon Solving Problems on Graphs of High Rank-Width Eduard Eiben, Robert Ganian, Stefan Szeider The Parametric Closure Problem David Eppstein Rooted Cycle Bases David Eppstein, J. Michael McCarthy, Brian E. Parrish On the Chain Pair Simplification Problem Chenglin Fan, Omrit Filtser, Matthew J. Katz, Tim Wylie, Binhai Zhu Finding Articulation Points of Large Graphs in Linear Time Martín Farach-Colton, Tsan-sheng Hsu, Meng Li, Meng-Tsung Tsai LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, José A. Soto Universal Reconstruction of a String Paweł Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń The Complexity of Dominating Set Reconfiguration Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki et al. Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes Falk Hüffner, Christian Komusiewicz, André Nichterlein Competitive Diffusion on Weighted Graphs Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa et al. Sorting and Selection with Equality Comparisons Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, Srinivasa Rao Satti Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno Fast and Simple Connectivity in Graph Timelines Adam Karczmarz, Jakub Łącki Dynamic Set Intersection Tsvi Kopelowitz, Seth Pettie, Ely Porat
856			_uhttp://link.springer.com/openurl?genre=book&isbn=978-3-319-21839-7
942			_cEBK