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.
LATIN 2012: Theoretical informatics : 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings / David Fernández-Baca (ed.).
LATIN 2012: Theoretical informatics : 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings / David Fernández-Baca (ed.).
Creatore [Latin American Symposium on Theoretical Informatics (10th : 2012 : Arequipa, Peru)]
Estensione 1 online resource (xvii, 669 pages).
Disciplina 004
Accesso persona Fernández-Baca, David
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer Communication Networks
Computer software
Electronic data processing
Computational complexity
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Numeric Computing
Information Systems Applications (incl. Internet)
Computation by Abstract Devices
ISBN 9783642293443
3642293441
9783642293436
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A Generalization of the Convex Kakeya Problem / Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson and Takeshi Tokuyama, et al. -- Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines / Eric Angel, Evripidis Bampis and Vincent Chau -- Bichromatic 2-Center of Pairs of Points / Esther M. Arkin, José Miguel Díaz-Báñez, Ferran Hurtado, Piyush Kumar and Joseph S.B. Mitchell, et al. -- Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs / Vikraman Arvind, Partha Mukhopadhyay and Prajakta Nimbhorkar -- A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem / Rafael da Ponte Barbosa and Yoshiko Wakabayashi -- On the Advice Complexity of the Knapsack Problem / Hans-Joachim Böckenhauer, Dennis Komm, Richard Královič and Peter Rossmanith -- Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems / Nicolas Boria, Jérôme Monnot and Vangelis Th. Paschos -- On Plane Constrained Bounded-Degree Spanners / Prosenjit Bose, Rolf Fagerberg, André van Renssen and Sander Verdonschot.
Space-Efficient Approximation Scheme for Circular Earth Mover Distance / Joshua Brody, Hongyu Liang and Xiaoming Sun -- Density Classification on Infinite Lattices and Trees / Ana Bušić, Nazim Fatès, Jean Mairesse and Irène Marcovici -- Coloring Planar Homothets and Three-Dimensional Hypergraphs / Jean Cardinal and Matias Korman -- An Equivariance Theorem with Applications to Renaming / Armando Castañeda, Maurice Herlihy and Sergio Rajsbaum -- Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks / Armando Castañeda, Damien Imbs, Sergio Rajsbaum and Michel Raynal -- Pseudorandomness of a Random Kronecker Sequence / Eda Cesaratto and Brigitte Vallée -- Revisiting the Cache Miss Analysis of Multithreaded Algorithms / Richard Cole and Vijaya Ramachandran -- Parameterized Complexity of MaxSat above Average / Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman and Saket Saurabh -- Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2n / Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk.
On the Non-progressive Spread of Influence through Social Networks / MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi and Vahab Mirrokni, et al. -- Forbidden Patterns / Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein and Veli Mäkinen, et al. -- Structural Complexity of Multiobjective NP Search Problems / Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner and Maximilian Witek -- k-Gap Interval Graphs / Fedor V. Fomin, Serge Gaspers, Petr Golovach, Karol Suchan and Stefan Szeider, et al. -- Decidability Classes for Mobile Agents Computing / Pierre Fraigniaud and Andrzej Pelc -- NE Is Not NP Turing Reducible to Nonexponentially Dense NP Sets / Bin Fu -- Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width / Martin Fürer -- Indexed Multi-pattern Matching / Travis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen and Leena Salmela, et al. -- New Lower Bound on Max Cut of Hypergraphs with an Application to r-Set Splitting / Archontia C. Giannopoulou, Sudeshna Kolay and Saket Saurabh.
Cache Me If You Can: Capacitated Selfish Replication Games / Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan and Rajmohan Rajaraman, et al. -- The Efficiency of MapReduce in Parallel External Memory / Gero Greiner and Riko Jacob -- Algorithms for Some H-Join Decompositions / Michel Habib, Antoine Mamcarz and Fabien de Montgolfier -- On the Bend-Number of Planar and Outerplanar Graphs / Daniel Heldt, Kolja Knauer and Torsten Ueckerdt -- Hiring above the m-th Best Candidate: A Generalization of Records in Permutations / Ahmed Helmi, Conrado Martínez and Alois Panholzer -- On the Performance of Smith's Rule in Single-Machine Scheduling with Nonlinear Cost / Wiebke Höhn and Tobias Jacobs -- Advantage of Overlapping Clusters for Minimizing Conductance / Rohit Khandekar, Guy Kortsarz and Vahab Mirrokni -- Independence of Tabulation-Based Hash Classes / Toryn Qwyllyn Klassen and Philipp Woelfel -- Oblivious Two-Way Finite Automata: Decidability and Complexity / Martin Kutrib, Andreas Malcher and Giovanni Pighizzini.
Clique-Colouring and Biclique-Colouring Unichord-Free Graphs / Hélio B. Macêdo Filho, Raphael C.S. Machado and Celina M.H. Figueiredo -- Random Walks and Bisections in Random Circulant Graphs / Bernard Mans and Igor E. Shparlinski -- The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem / Monaldo Mastrolilli -- Fully Analyzing an Algebraic Pólya Urn Model / Basile Morcrette -- Degree-Constrained Node-Connectivity / Zeev Nutov -- Survivable Network Activation Problems / Zeev Nutov -- On the Integrality Gap of the Subtour LP for the 1,2-TSP / Jiawei Qian, Frans Schalekamp, David P. Williamson and Anke van Zuylen -- A Theory and Algorithms for Combinatorial Reoptimization / Hadas Shachnai, Gal Tamir and Tami Tamir -- Capacity Achieving Two-Write WOM Codes / Amir Shpilka -- The Relationship between Inner Product and Counting Cycles / Xiaoming Sun, Chengu Wang and Wei Yu -- Approximating Minimum Label s-t Cut via Linear Programming / Linqing Tang and Peng Zhang.
A O(1/ε2)n-Time Sieving Algorithm for Approximate Integer Programming / Daniel Dadush -- Two-Dimensional Range Diameter Queries / Pooya Davoodi, Michiel Smid and Freek van Walderveen -- An Improved Upper Bound on the Density of Universal Random Graphs / Domingos Dellamonica, Yoshiharu Kohayakawa, Vojtěch Rödl and Andrzej Ruciński -- Logspace Computations in Graph Groups and Coxeter Groups / Volker Diekert, Jonathan Kausch and Markus Lohrey -- Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points / Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce and Ladislav Stacho -- On the Radon Number for P3-Convexity / Mitre C. Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp M. Schäfer and Jayme L. Szwarcfiter, et al. -- Computing Minimum Geodetic Sets of Proper Interval Graphs / Tınaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof and Daniel Meister -- Hausdorff Rank of Scattered Context-Free Linear Orders / Zoltán Ésik and Szabolcs Iván -- Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism / Martín Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro and Shmuel Zaks.
Record Nr. NYU-004374940
[Latin American Symposium on Theoretical Informatics (10th : 2012 : Arequipa, Peru)]  
Materiale a stampa
Lo trovi qui: New York University
Distributed computing : 28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014 : proceedings / Fabian Kuhn (Ed.).
Distributed computing : 28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014 : proceedings / Fabian Kuhn (Ed.).
Creatore [DISC (Symposium) (28th : 2014 : Austin, Texas)]
Estensione 1 online resource (XXIII, 573 pages).
Disciplina 004/.36
Accesso persona Kuhn, Fabian, editor
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783662451748
3662451743
9783662451731
3662451735
Classificazione 54.71
54.51
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Concurrency -- Automatically Adjusting Concurrency to the Level of Synchrony -- Biological and Chemical Networks -- Speed Faults in Computation by Chemical Reaction Networks -- Fault-Tolerant ANTS -- Task Allocation in Ant Colonies -- Agreement Problems -- Communication-Efficient Randomized Consensus -- Tight Bound on Mobile Byzantine Agreement -- Unbeatable Consensus -- Reliable Broadcast with Respect to Topology Knowledge -- Robot Coordination, Scheduling -- Evacuating Robots via Unknown Exit in a Disk -- Randomized Pattern Formation Algorithm for Asynchronous Oblivious Mobile Robots -- A Theoretical Foundation for Scheduling and Designing Heterogeneous Processors for Interactive Applications -- Graph Distances and Routing -- Vertex Fault Tolerant Additive Spanners -- Close to Linear Space Routing Schemes -- Near-Optimal Distributed Tree Embedding -- Radio Networks -- Deterministic Leader Election in Multi-hop Beeping Networks (Extended Abstract) -- Who Are You? Secure Identities in Ad Hoc Networks -- Approximate Local Sums and Their Applications in Radio Networks -- Radio Network Lower Bounds Made Easy -- Shared Memory -- On Correctness of Data Structures under Reads-Write Concurrency -- Solo-Fast Universal Constructions for Deterministic Abortable Objects -- Space Bounds for Adaptive Renaming -- Dynamic and Social Networks Lower Bounds for Structuring Unreliable Radio Networks -- Random Walks on Evolving Graphs with Recurring Topologies -- Randomized Rumor Spreading in Poorly Connected Small-World Networks -- Relativistic Systems -- Making Sense of Relativistic Distributed Systems -- Transactional Memory and Concurrent Data Structures -- Safety of Live Transactions in Transactional Memory: TMS is Necessary and Sufficient -- Decomposing Opacity -- The Adaptive Priority Queue with Elimination and Combining -- Improving Average Performance by Relaxing Distributed Data Structures -- Distributed Graph Algorithms -- Almost-Tight Distributed Minimum Cut Algorithms -- Distributed Algorithms for Coloring Interval Graphs -- Distributed Symmetry Breaking in Hypergraphs -- Communication -- On Streaming and Communication Complexity of the Set Cover Problem -- On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model -- Near-Constant-Time Distributed Algorithms on a Congested Clique -- Brief Announcement: Replacement -- Handling Failures in a Replicated State Machine -- Brief Announcement: The Power of Scheduling-Aware Synchronization -- Brief Announcement: Assignment of Different-Sized Inputs in MapReduce -- Brief Announcement: Scheduling Multiple Objects in Distributed Transactional Memory -- Brief Announcement: Relaxing Opacity in Pessimistic Transactional Memory -- Brief Announcement: A Practical Transactional Memory Interface -- Brief Announcement: On Dynamic and Multi-functional Labeling Schemes -- Brief Announcement: Update Consistency in Partitionable Systems -- Brief Announcement: Breaching the Wall of Impossibility Results on Disjoint-Access Parallel TM -- Brief Announcement: COP Composition Using Transaction Suspension in the Compiler -- Brief Announcement: Non-blocking Monitor Executions for Increased Parallelism -- Brief Announcement: Agreement in Partitioned Dynamic Networks -- Brief Announcement: The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm -- Brief Announcement: k-Selection and Sorting in the SINR Model -- Brief Announcement: Distributed 3/2-Approximation of the Diameter -- Brief Announcement: Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes -- Brief Announcement: Secure Anonymous Broadcast -- Brief Announcement: Privacy-Preserving Location-Based Services.
Record Nr. NYU-004450478
[DISC (Symposium) (28th : 2014 : Austin, Texas)]  
Materiale a stampa
Lo trovi qui: New York University
Algorithms and computation [electronic resource] : 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings / edited by Khaled Elbassioni, Kazuhisa Makino
Algorithms and computation [electronic resource] : 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings / edited by Khaled Elbassioni, Kazuhisa Makino
Creatore [ISAAC (Symposium) (26th : 2015 : Nagoya-shi, Japan)]
Estensione 1 online resource (xxii, 793 p.) : ill.
Disciplina 005.1
Accesso persona Elbassioni, Khaled.editor.
Makino, Kazuhisa.editor.
Genere/Forma Conference papers and proceedings
ISBN 9783662489710
3662489716
9783662489703
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. NYU-004459135
[ISAAC (Symposium) (26th : 2015 : Nagoya-shi, Japan)]  
Materiale a stampa
Lo trovi qui: New York University
Automata, languages, and programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, proceedings. Part I / Fedor V. Fomin, Rūsin̜š Freivalds, Marta Kwiatkowska, David Peleg (eds.).
Automata, languages, and programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, proceedings. Part I / Fedor V. Fomin, Rūsin̜š Freivalds, Marta Kwiatkowska, David Peleg (eds.).
Creatore [International Colloquium on Automata, Languages, and Programming (40th : 2013 : Rīga, Latvia)]
Estensione 1 online resource (882 pages) : illustrations.
Disciplina 005.1/3
Accesso persona Fomin, Fedor V., editor.
Freĭvald, R. V., editor.
Kwiatkowska, Marta, editor
Peleg, D. (David), editor.
Genere/Forma Congresses
Electronic books
Conference papers and proceedings
ISBN 9783642392061
3642392067
9783642392054
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithms, complexity and games -- Logic, semantics, automata and theory of programming -- Foundations of networked computation.
Record Nr. NYU-004420438
[International Colloquium on Automata, Languages, and Programming (40th : 2013 : Rīga, Latvia)]  
Materiale a stampa
Lo trovi qui: New York University
Foundations of software science and computational structures : 14th International Conference, FOSSACS 2011, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26-April 3, 2011 : proceedings / Martin Hofmann (ed.).
Foundations of software science and computational structures : 14th International Conference, FOSSACS 2011, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26-April 3, 2011 : proceedings / Martin Hofmann (ed.).
Creatore [FOSSACS (Conference) (14th : 2011 : Saarbrücken, Germany)]
Estensione 1 online resource (xv, 472 pages) : illustrations.
Disciplina 005.1
Accesso persona Hofmann, Martin
Accesso convegno ETAPS (Conference) (2011 : Saarbrücken, Germany)
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783642198052
3642198058
9783642198045
364219804X
Classificazione 54.50
54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. NYU-004368732
[FOSSACS (Conference) (14th : 2011 : Saarbrücken, Germany)]  
Materiale a stampa
Lo trovi qui: New York University
Programming languages and systems : 24th European Symposium on Programming, ESOP 2015, held as art of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings / Jan Vitek (ed.).
Programming languages and systems : 24th European Symposium on Programming, ESOP 2015, held as art of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings / Jan Vitek (ed.).
Creatore [European Symposium on Programming (24th : 2015 : London, England)]
Estensione 1 online resource (xiv, 838 pages) : illustrations.
Disciplina 005.1
Accesso persona Vitek, Jan (Computer scientist), editor
Accesso convegno ETAPS (Conference) (18th : 2015 : London, England)
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783662466698
3662466694
3662466686
9783662466681
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Probabilistic Programs as Spreadsheet Queries -- Static Analysis of Spreadsheet Applications for Type-Unsafe Operations Detection -- Running Probabilistic Programs Backwards -- A Verified Compiler for Probability Density Functions -- Segment Abstraction for Worst-Case Execution Time Analysis -- Automatic Static Cost Analysis for Parallel Programs -- Sound, Modular and Compositional Verification of the Input/Output Behavior of Programs -- Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs. A Theory of Name Resolution -- A Core Calculus for XQuery 3.0: Combining Navigational and Pattern Matching Approaches -- IsoLate: A Type System for Self-recursion -- The Problem of PL Concurrency Semantics -- The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO -- Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity -- Witnessing (Co)datatypes -- Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System -- Refinement Types for Incremental Computational Complexity -- Monotonic References for Efficient Gradual Typing -- Inter-procedural Two-Variable Herbrand Equalities -- Desynchronized Multi-State Abstractions for Open Programs in Dynamic Languages -- Fine-Grained Detection of Privilege Escalation Attacks on Browser Extensions -- Analysis of Asynchronous Programs with Event-Based Synchronization -- A Semantics for Propositions as Sessions -- Composite Replicated Data Types -- Relaxed Stratification: A New Approach to Practical Complete Predicate Refinement -- Spatial Interpolants -- Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs -- Full Reduction in the Face of Absurdity -- CoLoSL: Concurrent Local Subjective Logic -- A Separation Logic for Fictional Sequential Consistency -- Binding Structures as an Abstract Data Type -- Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages -- Type Targeted
Record Nr. NYU-006560717
[European Symposium on Programming (24th : 2015 : London, England)]  
Materiale a stampa
Lo trovi qui: New York University
Algorithms, ESA 2009 : 17th annual European symposium, Copenhagen, Denmark, September 7-9 : proceedings / Amos Fiat, Peter Sanders (eds.).
Algorithms, ESA 2009 : 17th annual European symposium, Copenhagen, Denmark, September 7-9 : proceedings / Amos Fiat, Peter Sanders (eds.).
Creatore [ESA (Symposium) (17th : 2009 : Copenhagen, Denmark)]
Estensione 1 online resource (xix, 790 pages) : illustrations.
Disciplina 006.3/1
Accesso persona Fiat, Amos
Sanders, Peter, 1967-
ISBN 9783642041280
3642041280
9783642041273
3642041272
Classificazione O24-532
TP301. 6-532
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UALBERTA-7956850
[ESA (Symposium) (17th : 2009 : Copenhagen, Denmark)]  
Materiale a stampa
Lo trovi qui: University of Alberta / NEOS Library Consortium
Programming languages and systems : 26th European Symposium on Programming, ESOP 2017, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, proceedings / Hongseok Yang (ed.).
Programming languages and systems : 26th European Symposium on Programming, ESOP 2017, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, proceedings / Hongseok Yang (ed.).
Creatore [European Symposium on Programming (26th : 2017 : Uppsala, Sweden)]
Estensione 1 online resource (xv, 992 pages) : illustrations.
Disciplina 005.1
Accesso persona Yang, Hongseok, editor
Accesso convegno ETAPS (Conference) (20th : 2017 : Uppsala, Sweden), jointly held conference
Genere/Forma Conference papers and proceedings
ISBN 9783662544341
3662544342
9783662544334
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UALBERTA-7870827
[European Symposium on Programming (26th : 2017 : Uppsala, Sweden)]  
Materiale a stampa
Lo trovi qui: University of Alberta / NEOS Library Consortium
Graph-theoretic concepts in computer science : 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised selected papers / Hans L. Bodlaender, Gerhard J. Woeginger (eds.).
Graph-theoretic concepts in computer science : 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised selected papers / Hans L. Bodlaender, Gerhard J. Woeginger (eds.).
Creatore [International Workshop WG (43rd : 2017 : Eindhoven, Netherlands)]
Estensione 1 online resource (xiii, 440 pages) : illustrations.
Accesso persona Bodlaender, H. L., editor.
Woeginger, Gerhard, editor
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783319687056
3319687050
9783319687049
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UCHICAGO-11388984
[International Workshop WG (43rd : 2017 : Eindhoven, Netherlands)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Graph-theoretic concepts in computer science : 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised selected papers / Pinar Heggernes (eds.).
Graph-theoretic concepts in computer science : 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised selected papers / Pinar Heggernes (eds.).
Creatore [International Workshop WG (42nd : 2016 : Istanbul, Turkey)]
Estensione 1 online resource (x, 307 pages) : illustrations.
Accesso persona Heggernes, Pinar, editor
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783662535363
366253536X
3662535351
9783662535356
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Sequences of radius "k" for complete bipartite graphs -- Approximate Association via Dissociation -- Geodetic convexity parameters for graphs with few short induced paths -- Weighted Ecient Domination for P5-Free and for P6-Free Graphs -- Saving colors and Max Coloring: some xed-parameter tractability results -- Finding Two Edge-Disjoint Paths with Length Constraints -- Packing and covering immersion models of planar subcubic graphs -- The maximum weight stable set problem in (P 6, bull)-free graphs -- Parameterized Power Vertex Cover -- Exhaustive generation of k-critical H-free graphs -- Induced separation dimension -- Tight Bounds for Gomory-Hu-like Cut Counting -- Eccentricity Approximating Trees: Extended Abstract -- Drawing Planar Graphs with Prescribed Face Areas -- Vertex Cover Structural Parameterization Revisited -- Distance-d Independent Set and other problems in graphs with "few" minimal separators -- Parameterized complexity of the MINCCA problem on graphs of bounded decomposability -- On edge intersection graphs of paths with 2 bends -- Almost Induced Matching: Linear Kernels and Parameterized Algorithms -- Parameterized vertex deletion problems for hereditary graph classes with a block property -- Harmonious Coloring: Parameterized Algorithms and Upper bounds -- On Directed Steiner Trees with Multiple Roots -- A Faster Parameterized Algorithm for Group Feedback Edge Set -- Sequence Hypergraphs -- On subgraphs of bounded degeneracy in hypergraphs.
Record Nr. UCHICAGO-11267542
[International Workshop WG (42nd : 2016 : Istanbul, Turkey)]  
Materiale a stampa
Lo trovi qui: University of Chicago