top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Computing and Combinatorics : 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings / Joachim Gudmundsson, Julián Mestre, Taso Viglas (eds.).
Computing and Combinatorics : 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings / Joachim Gudmundsson, Julián Mestre, Taso Viglas (eds.).
Creatore [COCOON 2012 (2012 : Sydney, N.S.W.)]
Estensione 1 online resource.
Accesso persona Gudmundsson, Joachim
Mestre, Julián
Viglas, Taso
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer Communication Networks
Computer software
Computational complexity
Artificial intelligence
Computer graphics
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Computation by Abstract Devices
ISBN 9783642322419
3642322417
9783642322402
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree / Binay Bhattacharya and Tsunehiko Kameda -- A Simple D2-Sampling Based PTAS for k-Means and other Clustering Problems / Ragesh Jaiswal, Amit Kumar and Sandeep Sen -- Speed Scaling for Maximum Lateness / Evripidis Bampis, Dimitrios Letsios, Ioannis Milis and Georgios Zois -- Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? / Peter Floderus, Mirosław Kowaluk, Andrzej Lingas and Eva-Marta Lundell -- Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs / Ivona Bezáková and Zachary Langley -- Online Knapsack Problem with Removal Cost / Xin Han, Yasushi Kawase and Kazuhisa Makino -- An Improved Exact Algorithm for TSP in Degree-4 Graphs / Mingyu Xiao and Hiroshi Nagamochi -- Dynamic Programming for H-minor-free Graphs / Juanjo Rué, Ignasi Sau and Dimitrios M. Thilikos -- Restricted Max-Min Fair Allocations with Inclusion-Free Intervals / Monaldo Mastrolilli and Georgios Stamoulis -- An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks / Maxim A. Babenko, Kamil Salikhov and Stepan Artamonov -- Towards Optimal and Expressive Kernelization for d-Hitting Set / René van Bevern.
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs / Jean-François Couturier, Pinar Heggernes, Pim van 't Hof and Yngve Villanger -- A Local Algorithm for Finding Dense Bipartite-Like Subgraphs / Pan Peng -- Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs / Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung and Yue-Li Wang -- On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property / Biing-Feng Wang and Chih-Hsuan Li -- Rainbow Colouring of Split and Threshold Graphs / L. Sunil Chandran and Deepak Rajendraprasad -- Approximating the Rainbow -- Better Lower and Upper Bounds / Alexandru Popa -- Ramsey Numbers for Line Graphs and Perfect Graphs / Rémy Belmonte, Pinar Heggernes, Pim van 't Hof and Reza Saei -- Geodesic Order Types / Oswin Aichholzer, Matias Korman, Alexander Pilz and Birgit Vogtenhuber -- Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number / Stephane Durocher and Saeed Mehrabi -- Monotone Paths in Planar Convex Subdivisions / Adrian Dumitrescu, Günter Rote and Csaba D. Tóth -- The Cost of Bounded Curvature / Hyo-Sil Kim and Otfried Cheong.
Optimally Solving a Transportation Problem Using Voronoi Diagrams / Darius Geiß, Rolf Klein and Rainer Penninger -- Unexplored Steiner Ratios in Geometric Networks / Paz Carmi and Lilach Chaitman-Yerushalmi -- Geometric RAC Simultaneous Drawings of Graphs / Evmorfia Argyriou, Michael Bekos, Michael Kaufmann and Antonios Symvonis -- Simultaneous Embeddings with Vertices Mapping to Pre-specified Points / Taylor Gordon -- Multilevel Drawings of Clustered Graphs / Fabrizio Frati -- Outerplanar Graph Drawings with Few Slopes / Kolja Knauer, Piotr Micek and Bartosz Walczak -- Fáry's Theorem for 1-Planar Graphs / Seok-Hee Hong, Peter Eades, Giuseppe Liotta and Sheung-Hung Poon -- Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application / Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno and Hiroki Arimura -- External Memory Soft Heap, and Hard Heap, a Meldable Priority Queue / Alka Bhushan and Sajith Gopalan -- Partially Specified Nearest Neighbor Search / Tomas Hruz and Marcel Schöngens -- Multi-pattern Matching with Bidirectional Indexes / Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen and Niko Välimäki -- Succinct Representations of Binary Trees for Range Minimum Queries / Pooya Davoodi, Rajeev Raman and Srinivasa Rao Satti.
Lower Bounds against Weakly Uniform Circuits / Ruiwen Chen and Valentine Kabanets -- On TC0 Lower Bounds for the Permanent / Jeff Kinne -- Formula Complexity of Ternary Majorities / Kenya Ueno -- On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles / Fahad Panolan and Ashutosh Rai -- The Complexity of Unary Subset Sum / Nutan Limaye, Meena Mahajan and Karteek Sreenivasaiah -- On the Advice Complexity of Tournaments / Sebastian Ben Daniel -- A Remark on One-Wayness versus Pseudorandomness / Periklis A. Papakonstantinou and Guang Yang -- Integral Mixed Unit Interval Graphs / Van Bang Le and Dieter Rautenbach -- Complementary Vertices and Adjacency Testing in Polytopes / Benjamin A. Burton -- Online Coloring of Bipartite Graphs with and without Advice / Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovič and Lucia Keller -- Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms / Paweł Górecki and Oliver Eulenstein -- On the 2-Central Path Problem / Yongding Zhu and Jinhui Xu -- Making Profit in a Prediction Market / Jen-Hou Chou, Chi-Jen Lu and Mu-En Wu -- Computing Shapley Value in Supermodular Coalitional Games / David Liben-Nowell, Alexa Sharp, Tom Wexler and Kevin Woods -- Equilibria of GSP for Range Auction / H.F. Ting and Xiangzhong Xiang -- Stretch in Bottleneck Games / Costas Busch and Rajgopal Kannan.
Record Nr. UCHICAGO-11077264
[COCOON 2012 (2012 : Sydney, N.S.W.)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Experimental Algorithms [electronic resource] : 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 – July 1, 2014. Proceedings / edited by Joachim Gudmundsson, Jyrki Katajainen
Experimental Algorithms [electronic resource] : 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 – July 1, 2014. Proceedings / edited by Joachim Gudmundsson, Jyrki Katajainen
Creatore [Gudmundsson, Joachim]
Estensione XX, 450 p. 126 illus : online resource.
Disciplina 005.1
Accesso persona Katajainen, Jyrki
Accesso ente SpringerLink (Online service)
ISBN 9783319079592
Formato Risorse elettroniche
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. YALE-12161842
[Gudmundsson, Joachim]  
Risorse elettroniche
Lo trovi qui: Yale University
Computing and Combinatorics : 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings / Joachim Gudmundsson, Julián Mestre, Taso Viglas (eds.).
Computing and Combinatorics : 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings / Joachim Gudmundsson, Julián Mestre, Taso Viglas (eds.).
Creatore [COCOON 2012 (2012 : Sydney, N.S.W.)]
Estensione 1 online resource.
Disciplina 511/.6
Accesso persona Gudmundsson, Joachim
Mestre, Julián
Viglas, Taso
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer Communication Networks
Computer software
Computational complexity
Artificial intelligence
Computer graphics
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Computation by Abstract Devices
ISBN 9783642322419
3642322417
9783642322402
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree / Binay Bhattacharya and Tsunehiko Kameda -- A Simple D2-Sampling Based PTAS for k-Means and other Clustering Problems / Ragesh Jaiswal, Amit Kumar and Sandeep Sen -- Speed Scaling for Maximum Lateness / Evripidis Bampis, Dimitrios Letsios, Ioannis Milis and Georgios Zois -- Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? / Peter Floderus, Mirosław Kowaluk, Andrzej Lingas and Eva-Marta Lundell -- Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs / Ivona Bezáková and Zachary Langley -- Online Knapsack Problem with Removal Cost / Xin Han, Yasushi Kawase and Kazuhisa Makino -- An Improved Exact Algorithm for TSP in Degree-4 Graphs / Mingyu Xiao and Hiroshi Nagamochi -- Dynamic Programming for H-minor-free Graphs / Juanjo Rué, Ignasi Sau and Dimitrios M. Thilikos -- Restricted Max-Min Fair Allocations with Inclusion-Free Intervals / Monaldo Mastrolilli and Georgios Stamoulis -- An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks / Maxim A. Babenko, Kamil Salikhov and Stepan Artamonov -- Towards Optimal and Expressive Kernelization for d-Hitting Set / René van Bevern.
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs / Jean-François Couturier, Pinar Heggernes, Pim van 't Hof and Yngve Villanger -- A Local Algorithm for Finding Dense Bipartite-Like Subgraphs / Pan Peng -- Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs / Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung and Yue-Li Wang -- On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property / Biing-Feng Wang and Chih-Hsuan Li -- Rainbow Colouring of Split and Threshold Graphs / L. Sunil Chandran and Deepak Rajendraprasad -- Approximating the Rainbow -- Better Lower and Upper Bounds / Alexandru Popa -- Ramsey Numbers for Line Graphs and Perfect Graphs / Rémy Belmonte, Pinar Heggernes, Pim van 't Hof and Reza Saei -- Geodesic Order Types / Oswin Aichholzer, Matias Korman, Alexander Pilz and Birgit Vogtenhuber -- Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number / Stephane Durocher and Saeed Mehrabi -- Monotone Paths in Planar Convex Subdivisions / Adrian Dumitrescu, Günter Rote and Csaba D. Tóth -- The Cost of Bounded Curvature / Hyo-Sil Kim and Otfried Cheong.
Optimally Solving a Transportation Problem Using Voronoi Diagrams / Darius Geiß, Rolf Klein and Rainer Penninger -- Unexplored Steiner Ratios in Geometric Networks / Paz Carmi and Lilach Chaitman-Yerushalmi -- Geometric RAC Simultaneous Drawings of Graphs / Evmorfia Argyriou, Michael Bekos, Michael Kaufmann and Antonios Symvonis -- Simultaneous Embeddings with Vertices Mapping to Pre-specified Points / Taylor Gordon -- Multilevel Drawings of Clustered Graphs / Fabrizio Frati -- Outerplanar Graph Drawings with Few Slopes / Kolja Knauer, Piotr Micek and Bartosz Walczak -- Fáry's Theorem for 1-Planar Graphs / Seok-Hee Hong, Peter Eades, Giuseppe Liotta and Sheung-Hung Poon -- Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application / Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno and Hiroki Arimura -- External Memory Soft Heap, and Hard Heap, a Meldable Priority Queue / Alka Bhushan and Sajith Gopalan -- Partially Specified Nearest Neighbor Search / Tomas Hruz and Marcel Schöngens -- Multi-pattern Matching with Bidirectional Indexes / Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen and Niko Välimäki -- Succinct Representations of Binary Trees for Range Minimum Queries / Pooya Davoodi, Rajeev Raman and Srinivasa Rao Satti.
Lower Bounds against Weakly Uniform Circuits / Ruiwen Chen and Valentine Kabanets -- On TC0 Lower Bounds for the Permanent / Jeff Kinne -- Formula Complexity of Ternary Majorities / Kenya Ueno -- On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles / Fahad Panolan and Ashutosh Rai -- The Complexity of Unary Subset Sum / Nutan Limaye, Meena Mahajan and Karteek Sreenivasaiah -- On the Advice Complexity of Tournaments / Sebastian Ben Daniel -- A Remark on One-Wayness versus Pseudorandomness / Periklis A. Papakonstantinou and Guang Yang -- Integral Mixed Unit Interval Graphs / Van Bang Le and Dieter Rautenbach -- Complementary Vertices and Adjacency Testing in Polytopes / Benjamin A. Burton -- Online Coloring of Bipartite Graphs with and without Advice / Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovič and Lucia Keller -- Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms / Paweł Górecki and Oliver Eulenstein -- On the 2-Central Path Problem / Yongding Zhu and Jinhui Xu -- Making Profit in a Prediction Market / Jen-Hou Chou, Chi-Jen Lu and Mu-En Wu -- Computing Shapley Value in Supermodular Coalitional Games / David Liben-Nowell, Alexa Sharp, Tom Wexler and Kevin Woods -- Equilibria of GSP for Range Auction / H.F. Ting and Xiangzhong Xiang -- Stretch in Bottleneck Games / Costas Busch and Rajgopal Kannan.
Record Nr. NYU-004624193
[COCOON 2012 (2012 : Sydney, N.S.W.)]  
Materiale a stampa
Lo trovi qui: New York University
Algorithm theory--SWAT 2008 : 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008 ; proceedings / Joachim Gudmundsson (ed.).
Algorithm theory--SWAT 2008 : 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008 ; proceedings / Joachim Gudmundsson (ed.).
Creatore [Scandinavian Workshop on Algorithm Theory (11th : 2008 : Göteborg, Sweden)]
Estensione 1 online resource (xiii, 438 pages) : illustrations.
Disciplina 004
Accesso persona Gudmundsson, Joachim
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783540699033
3540699031
9783540699002
3540699007
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Lectures -- A Survey of Results for Deletion Channels and Related Synchronization Channels -- Nash Bargaining Via Flexible Budget Markets -- Contributed Papers -- Simplified Planar Coresets for Data Streams -- Uniquely Represented Data Structures for Computational Geometry -- I/O Efficient Dynamic Data Structures for Longest Prefix Queries -- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear -- Vision-Based Pursuit-Evasion in a Grid -- Angle Optimization in Target Tracking -- Improved Bounds for Wireless Localization -- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem -- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint -- The Maximum Energy-Constrained Dynamic Flow Problem -- Bounded Unpopularity Matchings -- Data Structures with Local Update Operations -- On the Redundancy of Succinct Data Structures -- Confluently Persistent Tries for Efficient Version Control -- A Uniform Approach Towards Succinct Representation of Trees -- An Algorithm for L(2,1)-Labeling of Trees -- Batch Coloring Flat Graphs and Thin -- Approximating the Interval Constrained Coloring Problem -- A Path Cover Technique for LCAs in Dags -- Boundary Labeling with Octilinear Leaders -- Distributed Disaster Disclosure -- Reoptimization of Steiner Trees -- On the Locality of Extracting a 2-Manifold in -- On Metric Clustering to Minimize the Sum of Radii -- On Covering Problems of Rado -- Packing Rectangles into 2OPT Bins Using Rotations -- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees -- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs -- On a Special Co-cycle Basis of Graphs -- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs -- Spanners of Additively Weighted Point Sets -- The Kinetic Facility Location Problem -- Computing the Greedy Spanner in Near-Quadratic Time -- Parameterized Computational Complexity of Dodgson and Young Elections -- Online Compression Caching -- On Trade-Offs in External-Memory Diameter-Approximation.
Record Nr. NYU-004611309
[Scandinavian Workshop on Algorithm Theory (11th : 2008 : Göteborg, Sweden)]  
Materiale a stampa
Lo trovi qui: New York University
Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51 Edited by Joachim Gudmundsson, Barry Jay. [electronic resource]
Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51 Edited by Joachim Gudmundsson, Barry Jay. [electronic resource]
Creatore [2006 Hobart Australia, Gudmundsson, Joachim]
Estensione 1 online resource (159 pages)
Accesso persona Gudmundsson, Joachim
Jay, Barry
Accesso ente Association for Computing Machinery-Digital Library
ISBN 9781920682330
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. NYU-007598984
[2006 Hobart Australia, Gudmundsson, Joachim]  
Materiale a stampa
Lo trovi qui: New York University
Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51 Edited by Joachim Gudmundsson, Barry Jay. [electronic resource]
Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51 Edited by Joachim Gudmundsson, Barry Jay. [electronic resource]
Creatore [2006 Hobart Australia, Gudmundsson, Joachim]
Estensione 1 online resource (151 pages)
Accesso persona Gudmundsson, Joachim
Jay, Barry
Accesso ente Association for Computing Machinery-Digital Library
ISBN 9781920682330
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. NYU-007600037
[2006 Hobart Australia, Gudmundsson, Joachim]  
Materiale a stampa
Lo trovi qui: New York University
Computing and Combinatorics : 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012 : proceedings / Joachim Gudmundsson, Julián Mestre, Taso Viglas (eds.).
Computing and Combinatorics : 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012 : proceedings / Joachim Gudmundsson, Julián Mestre, Taso Viglas (eds.).
Creatore [COCOON (Conference) (18th : 2012 : Sydney, N.S.W.)]
Estensione 1 online resource (xiv, 606 p.) : ill.
Accesso persona Gudmundsson, Joachim
Mestre, Julián
Viglas, Taso
Genere/Forma Electronic books
ISBN 9783642322402
9783642322419
3642322409
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. DUKE-005758799
[COCOON (Conference) (18th : 2012 : Sydney, N.S.W.)]  
Materiale a stampa
Lo trovi qui: Duke University
Experimental Algorithms [electronic resource] : 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings / edited by Joachim Gudmundsson, Jyrki Katajainen
Experimental Algorithms [electronic resource] : 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings / edited by Joachim Gudmundsson, Jyrki Katajainen
Creatore [Gudmundsson, Joachim]
Estensione 1 online resource (XX, 450 p. 126 illus.) online resource.
Disciplina 005.1
Accesso persona Katajainen, Jyrki
Accesso ente SpringerLink (Online service)
Genere/Forma Electronic books
ISBN 9783319079592
9783319079585
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. DUKE-006143368
[Gudmundsson, Joachim]  
Materiale a stampa
Lo trovi qui: Duke University
Computing and Combinatorics [electronic resource] : 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings / edited by Joachim Gudmundsson, Julián Mestre, Taso Viglas
Computing and Combinatorics [electronic resource] : 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings / edited by Joachim Gudmundsson, Julián Mestre, Taso Viglas
Creatore [Gudmundsson, Joachim]
Estensione 1 online resource.
Disciplina 005.1
Accesso persona Mestre, Julián
Viglas, Taso
Accesso ente SpringerLink (Online service)
ISBN 9783642322419
Formato Risorse elettroniche
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. YALE-11049396
[Gudmundsson, Joachim]  
Risorse elettroniche
Lo trovi qui: Yale University
Algorithm Theory – SWAT 2008 [electronic resource] : 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008. Proceedings / edited by Joachim Gudmundsson
Algorithm Theory – SWAT 2008 [electronic resource] : 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008. Proceedings / edited by Joachim Gudmundsson
Creatore [Gudmundsson, Joachim]
Estensione v.: digital
Accesso ente SpringerLink (Online service)
ISBN 9783540699033
Formato Software
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. YALE-8388970
[Gudmundsson, Joachim]  
Software
Lo trovi qui: Yale University