Eintrag weiter verarbeiten
Online-Ressource

Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I

Gespeichert in:

Personen und Körperschaften: Berg, Mark (VerfasserIn), Meyer, Ulrich (Sonstige)
Titel: Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I/ edited by Mark Berg, Ulrich Meyer
Format: E-Book
Sprache: Englisch
veröffentlicht:
Berlin, Heidelberg Springer Berlin Heidelberg 2010
Gesamtaufnahme: SpringerLink
Lecture notes in computer science ; 6346
Schlagwörter:
Computer Communication Networks
Data structures (Computer science)
Computer software
Electronic data processing
Computational complexity
Computer Science
Computer science
Computer graphics
Computer networks .
Software engineering.
Discrete mathematics.
Algorithms.
Numerical analysis.
Buchausg. u.d.T.: Algorithsms - ESA 2010 ; Pt. 1, Berlin : Springer, 2010, XVIII, 587 S.
Quelle: Verbunddaten SWB
Zugangsinformationen: Elektronischer Volltext - Campuslizenz
LEADER 06939cam a22009132 4500
001 0-1650222521
003 DE-627
005 20240122105254.0
007 cr uuu---uuuuu
008 101005s2010 gw |||||o 00| ||eng c
020 |a 9783642157752  |9 978-3-642-15775-2 
024 7 |a 10.1007/978-3-642-15775-2  |2 doi 
035 |a (DE-627)1650222521 
035 |a (DE-576)330929453 
035 |a (DE-599)BSZ330929453 
035 |a (OCoLC)682059255 
035 |a (OCoLC)731498659 
035 |a (ZBM)1194.68069 
035 |a (DE-He213)978-3-642-15775-2 
035 |a (EBP)04052616X 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
044 |c XA-DE 
050 0 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
072 7 |a UMZ  |2 bicssc 
072 7 |a COM051230  |2 bisacsh 
084 |a SS 4800  |2 rvk  |0 (DE-625)rvk/143528: 
084 |a *68-06  |2 msc 
084 |a 68Wxx  |2 msc 
084 |a 00B25  |2 msc 
100 1 |a Berg, Mark  |4 aut 
245 1 0 |a Algorithms – ESA 2010  |b 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I  |c edited by Mark Berg, Ulrich Meyer 
264 1 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2010 
300 |a Online-Ressource (XVIII, 587p. 68 illus, digital) 
336 |a Text  |b txt  |2 rdacontent 
337 |a Computermedien  |b c  |2 rdamedia 
338 |a Online-Ressource  |b cr  |2 rdacarrier 
490 1 |a Lecture Notes in Computer Science  |v 6346 
490 0 |a SpringerLink  |a Bücher 
520 |a Invited Talk -- The Robustness of Level Sets -- Session 1a -- Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods -- Non-clairvoyant Speed Scaling for Weighted Flow Time -- A Robust PTAS for Machine Covering and Packing -- Session 1b -- Balancing Degree, Diameter and Weight in Euclidean Spanners -- Testing Euclidean Spanners -- Fast Approximation in Subspaces by Doubling Metric Decomposition -- f-Sensitivity Distance Oracles and Routing Schemes -- Session 2a -- Fast Minor Testing in Planar Graphs -- On the Number of Spanning Trees a Planar Graph Can Have -- Contractions of Planar Graphs in Polynomial Time -- Session 2b -- Communication Complexity of Quasirandom Rumor Spreading -- A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing -- Contribution Games in Social Networks -- Session 3a -- Improved Bounds for Online Stochastic Matching -- Online Stochastic Packing Applied to Display Ad Allocation -- Caching Is Hard – Even in the Fault Model -- Session 3b -- Superselectors: Efficient Constructions and Applications -- Estimating the Average of a Lipschitz-Continuous Function from One Sample -- Streaming Graph Computations with a Helpful Advisor -- Session 4a -- Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier -- Minimum Vertex Cover in Rectangle Graphs -- Feedback Vertex Sets in Tournaments -- Session 4b -- n-Level Graph Partitioning -- Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns -- Finding the Diameter in Real-World Graphs -- Session 5a -- Budgeted Red-Blue Median and Its Generalizations -- All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables -- Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems -- Robust Algorithms for Sorting Railway Cars -- Session 5b -- Cloning Voronoi Diagrams via Retroactive Data Structures -- A Unified Approach to Approximate Proximity Searching -- Spatio-temporal Range Searching over Compressed Kinetic Sensor Data -- Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space -- Invited Talk -- Local Graph Exploration and Fast Property Testing -- Session 6a -- A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings -- Fast Prefix Search in Little Space, with Applications -- On the Huffman and Alphabetic Tree Problem with General Cost Functions -- Medium-Space Algorithms for Inverse BWT -- Session 6b -- Median Trajectories -- Optimal Cover of Points by Disks in a Simple Polygon -- Stability of ?-Kernels -- The Geodesic Diameter of Polygonal Domains -- Session 7a -- Polyhedral and Algorithmic Properties of Quantified Linear Programs -- Approximating Parameterized Convex Optimization Problems -- Approximation Schemes for Multi-Budgeted Independence Systems -- Session 7b -- Algorithmic Meta-theorems for Restrictions of Treewidth -- Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus -- Constructing the R* Consensus Tree of Two Trees in Subcubic Time. 
650 0 |a Computer Communication Networks 
650 0 |a Data structures (Computer science) 
650 0 |a Computer software 
650 0 |a Electronic data processing 
650 0 |a Computational complexity 
650 0 |a Computer Science 
650 0 |a Computer science 
650 0 |a Computer graphics 
650 0 |a Computer networks . 
650 0 |a Software engineering. 
650 0 |a Discrete mathematics. 
650 0 |a Algorithms. 
650 0 |a Numerical analysis. 
700 1 |a Meyer, Ulrich  |d 1971-  |0 (DE-588)124358519  |0 (DE-627)085810010  |0 (DE-576)273555510  |4 oth 
776 1 |z 9783642157745 
776 0 8 |i Buchausg. u.d.T.  |t Algorithsms - ESA 2010 ; Pt. 1  |d Berlin : Springer, 2010  |h XVIII, 587 S.  |w (DE-627)1400554225  |w (DE-576)330554220  |z 3642157742  |z 9783642157745 
830 0 |a Lecture notes in computer science  |v 6346  |9 6346  |w (DE-627)316228877  |w (DE-576)093890923  |w (DE-600)2018930-8  |x 1611-3349  |7 ns 
856 4 0 |u https://doi.org/10.1007/978-3-642-15775-2  |m X:SPRINGER  |x Verlag  |z lizenzpflichtig  |3 Volltext 
856 4 2 |u https://zbmath.org/?q=an:1194.68069  |m B:ZBM  |v 2021-04-12  |x Verlag  |y Zentralblatt MATH  |3 Inhaltstext 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC  |b 2010 
912 |a ZDB-2-SEB 
912 |a ZDB-2-SCS  |b 2010 
912 |a ZDB-2-SXCS  |b 2010 
912 |a ZDB-2-SEB  |b 2010 
936 r v |a SS 4800  |b Lecture notes in computer science  |k Informatik  |k Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen  |k Schriftenreihen (indiv. Sign.)  |k Lecture notes in computer science  |0 (DE-627)1271461242  |0 (DE-625)rvk/143528:  |0 (DE-576)201461242 
951 |a BO 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-15775-2  |9 DE-14 
852 |a DE-14  |z 2011-07-20T14:58:14Z  |x epn:3336183367 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-15775-2  |9 DE-15 
852 |a DE-15  |z 2011-05-16T16:33:52Z  |x epn:3336183421 
976 |h Elektronischer Volltext - Campuslizenz 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-15775-2  |z Zum Online-Dokument  |9 DE-Zi4 
852 |a DE-Zi4  |z 2011-01-26T14:26:22Z  |x epn:3336183510 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-15775-2  |9 DE-520 
852 |a DE-520  |z 2010-10-05T14:42:39Z  |x epn:3336183545 
980 |a 1650222521  |b 0  |k 1650222521  |o 330929453 
openURL url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Algorithms+%E2%80%93+ESA+2010%3A+18th+Annual+European+Symposium%2C+Liverpool%2C+UK%2C+September+6-8%2C+2010.+Proceedings%2C+Part+I&rft.date=2010&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Algorithms+%E2%80%93+ESA+2010%3A+18th+Annual+European+Symposium%2C+Liverpool%2C+UK%2C+September+6-8%2C+2010.+Proceedings%2C+Part+I&rft.series=Lecture+notes+in+computer+science%2C+6346&rft.au=Berg%2C+Mark&rft.pub=Springer+Berlin+Heidelberg&rft.edition=&rft.isbn=3642157750
SOLR
_version_ 1789358717122117632
access_facet Electronic Resources
author Berg, Mark
author2 Meyer, Ulrich
author2_role oth
author2_variant u m um
author_facet Berg, Mark, Meyer, Ulrich
author_role aut
author_sort Berg, Mark
author_variant m b mb
callnumber-first Q - Science
callnumber-label QA76
callnumber-raw QA76.9.A43
callnumber-search QA76.9.A43
callnumber-sort QA 276.9 A43
callnumber-subject QA - Mathematics
collection ZDB-2-SCS, ZDB-2-LNC, ZDB-2-SEB, ZDB-2-SXCS
contents Invited Talk -- The Robustness of Level Sets -- Session 1a -- Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods -- Non-clairvoyant Speed Scaling for Weighted Flow Time -- A Robust PTAS for Machine Covering and Packing -- Session 1b -- Balancing Degree, Diameter and Weight in Euclidean Spanners -- Testing Euclidean Spanners -- Fast Approximation in Subspaces by Doubling Metric Decomposition -- f-Sensitivity Distance Oracles and Routing Schemes -- Session 2a -- Fast Minor Testing in Planar Graphs -- On the Number of Spanning Trees a Planar Graph Can Have -- Contractions of Planar Graphs in Polynomial Time -- Session 2b -- Communication Complexity of Quasirandom Rumor Spreading -- A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing -- Contribution Games in Social Networks -- Session 3a -- Improved Bounds for Online Stochastic Matching -- Online Stochastic Packing Applied to Display Ad Allocation -- Caching Is Hard – Even in the Fault Model -- Session 3b -- Superselectors: Efficient Constructions and Applications -- Estimating the Average of a Lipschitz-Continuous Function from One Sample -- Streaming Graph Computations with a Helpful Advisor -- Session 4a -- Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier -- Minimum Vertex Cover in Rectangle Graphs -- Feedback Vertex Sets in Tournaments -- Session 4b -- n-Level Graph Partitioning -- Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns -- Finding the Diameter in Real-World Graphs -- Session 5a -- Budgeted Red-Blue Median and Its Generalizations -- All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables -- Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems -- Robust Algorithms for Sorting Railway Cars -- Session 5b -- Cloning Voronoi Diagrams via Retroactive Data Structures -- A Unified Approach to Approximate Proximity Searching -- Spatio-temporal Range Searching over Compressed Kinetic Sensor Data -- Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space -- Invited Talk -- Local Graph Exploration and Fast Property Testing -- Session 6a -- A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings -- Fast Prefix Search in Little Space, with Applications -- On the Huffman and Alphabetic Tree Problem with General Cost Functions -- Medium-Space Algorithms for Inverse BWT -- Session 6b -- Median Trajectories -- Optimal Cover of Points by Disks in a Simple Polygon -- Stability of ?-Kernels -- The Geodesic Diameter of Polygonal Domains -- Session 7a -- Polyhedral and Algorithmic Properties of Quantified Linear Programs -- Approximating Parameterized Convex Optimization Problems -- Approximation Schemes for Multi-Budgeted Independence Systems -- Session 7b -- Algorithmic Meta-theorems for Restrictions of Treewidth -- Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus -- Constructing the R* Consensus Tree of Two Trees in Subcubic Time.
ctrlnum (DE-627)1650222521, (DE-576)330929453, (DE-599)BSZ330929453, (OCoLC)682059255, (OCoLC)731498659, (ZBM)1194.68069, (DE-He213)978-3-642-15775-2, (EBP)04052616X
de15_date 2011-05-16T16:33:52Z
doi_str_mv 10.1007/978-3-642-15775-2
facet_912a ZDB-2-SCS, ZDB-2-LNC, ZDB-2-SEB, ZDB-2-SXCS
facet_avail Online
finc_class_facet Informatik, Mathematik
finc_id_str 0001402037
fincclass_txtF_mv science-computerscience
format eBook
format_access_txtF_mv Book, E-Book
format_de105 Ebook
format_de14 Book, E-Book
format_de15 Book, E-Book
format_del152 Buch
format_detail_txtF_mv text-online-monograph-independent
format_dezi4 e-Book
format_finc Book, E-Book
format_legacy ElectronicBook
format_legacy_nrw Book, E-Book
format_nrw Book, E-Book
format_strict_txtF_mv E-Book
geogr_code not assigned
geogr_code_person not assigned
hierarchy_parent_id 0-316228877
hierarchy_parent_title Lecture notes in computer science
hierarchy_sequence 6346
hierarchy_top_id 0-316228877
hierarchy_top_title Lecture notes in computer science
id 0-1650222521
illustrated Not Illustrated
imprint Berlin, Heidelberg, Springer Berlin Heidelberg, 2010
imprint_str_mv Berlin, Heidelberg: Springer Berlin Heidelberg, 2010
institution DE-14, DE-Zi4, DE-520, DE-15
is_hierarchy_id 0-1650222521
is_hierarchy_title Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I
isbn 9783642157752
isbn_isn_mv 9783642157745, 3642157742
issn_isn_mv 1611-3349
kxp_id_str 1650222521
language English
last_indexed 2024-01-28T18:10:50.738Z
local_heading_facet_dezwi2 Computer Communication Networks, Data structures (Computer science), Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Computer graphics, Computer networks ., Software engineering., Discrete mathematics., Algorithms., Numerical analysis.
marc024a_ct_mv 10.1007/978-3-642-15775-2
match_str berg2010algorithmsesa201018thannualeuropeansymposiumliverpoolukseptember682010proceedingsparti
mega_collection Verbunddaten SWB
multipart_link 093890923
multipart_part (093890923)6346
names_id_str_mv (DE-588)124358519, (DE-627)085810010, (DE-576)273555510
oclc_num 682059255, 731498659
physical Online-Ressource (XVIII, 587p. 68 illus, digital)
publishDate 2010
publishDateSort 2010
publishPlace Berlin, Heidelberg
publisher Springer Berlin Heidelberg
record_format marcfinc
record_id 330929453
recordtype marcfinc
rsn_id_str_mv (DE-15)2462018
rvk_facet SS 4800
rvk_label Informatik, Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen, Schriftenreihen (indiv. Sign.), Lecture notes in computer science
rvk_path SS, SQ - SU, SS 4000 - SS 5999, SS 4800
rvk_path_str_mv SS, SQ - SU, SS 4000 - SS 5999, SS 4800
series Lecture notes in computer science, 6346
series2 Lecture Notes in Computer Science ; 6346, SpringerLink ; Bücher
source_id 0
spelling Berg, Mark aut, Algorithms – ESA 2010 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I edited by Mark Berg, Ulrich Meyer, Berlin, Heidelberg Springer Berlin Heidelberg 2010, Online-Ressource (XVIII, 587p. 68 illus, digital), Text txt rdacontent, Computermedien c rdamedia, Online-Ressource cr rdacarrier, Lecture Notes in Computer Science 6346, SpringerLink Bücher, Invited Talk -- The Robustness of Level Sets -- Session 1a -- Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods -- Non-clairvoyant Speed Scaling for Weighted Flow Time -- A Robust PTAS for Machine Covering and Packing -- Session 1b -- Balancing Degree, Diameter and Weight in Euclidean Spanners -- Testing Euclidean Spanners -- Fast Approximation in Subspaces by Doubling Metric Decomposition -- f-Sensitivity Distance Oracles and Routing Schemes -- Session 2a -- Fast Minor Testing in Planar Graphs -- On the Number of Spanning Trees a Planar Graph Can Have -- Contractions of Planar Graphs in Polynomial Time -- Session 2b -- Communication Complexity of Quasirandom Rumor Spreading -- A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing -- Contribution Games in Social Networks -- Session 3a -- Improved Bounds for Online Stochastic Matching -- Online Stochastic Packing Applied to Display Ad Allocation -- Caching Is Hard – Even in the Fault Model -- Session 3b -- Superselectors: Efficient Constructions and Applications -- Estimating the Average of a Lipschitz-Continuous Function from One Sample -- Streaming Graph Computations with a Helpful Advisor -- Session 4a -- Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier -- Minimum Vertex Cover in Rectangle Graphs -- Feedback Vertex Sets in Tournaments -- Session 4b -- n-Level Graph Partitioning -- Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns -- Finding the Diameter in Real-World Graphs -- Session 5a -- Budgeted Red-Blue Median and Its Generalizations -- All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables -- Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems -- Robust Algorithms for Sorting Railway Cars -- Session 5b -- Cloning Voronoi Diagrams via Retroactive Data Structures -- A Unified Approach to Approximate Proximity Searching -- Spatio-temporal Range Searching over Compressed Kinetic Sensor Data -- Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space -- Invited Talk -- Local Graph Exploration and Fast Property Testing -- Session 6a -- A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings -- Fast Prefix Search in Little Space, with Applications -- On the Huffman and Alphabetic Tree Problem with General Cost Functions -- Medium-Space Algorithms for Inverse BWT -- Session 6b -- Median Trajectories -- Optimal Cover of Points by Disks in a Simple Polygon -- Stability of ?-Kernels -- The Geodesic Diameter of Polygonal Domains -- Session 7a -- Polyhedral and Algorithmic Properties of Quantified Linear Programs -- Approximating Parameterized Convex Optimization Problems -- Approximation Schemes for Multi-Budgeted Independence Systems -- Session 7b -- Algorithmic Meta-theorems for Restrictions of Treewidth -- Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus -- Constructing the R* Consensus Tree of Two Trees in Subcubic Time., Computer Communication Networks, Data structures (Computer science), Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Computer graphics, Computer networks ., Software engineering., Discrete mathematics., Algorithms., Numerical analysis., Meyer, Ulrich 1971- (DE-588)124358519 (DE-627)085810010 (DE-576)273555510 oth, 9783642157745, Buchausg. u.d.T. Algorithsms - ESA 2010 ; Pt. 1 Berlin : Springer, 2010 XVIII, 587 S. (DE-627)1400554225 (DE-576)330554220 3642157742 9783642157745, Lecture notes in computer science 6346 6346 (DE-627)316228877 (DE-576)093890923 (DE-600)2018930-8 1611-3349 ns, https://doi.org/10.1007/978-3-642-15775-2 X:SPRINGER Verlag lizenzpflichtig Volltext, https://zbmath.org/?q=an:1194.68069 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext, http://dx.doi.org/10.1007/978-3-642-15775-2 DE-14, DE-14 2011-07-20T14:58:14Z epn:3336183367, http://dx.doi.org/10.1007/978-3-642-15775-2 DE-15, DE-15 2011-05-16T16:33:52Z epn:3336183421, http://dx.doi.org/10.1007/978-3-642-15775-2 Zum Online-Dokument DE-Zi4, DE-Zi4 2011-01-26T14:26:22Z epn:3336183510, http://dx.doi.org/10.1007/978-3-642-15775-2 DE-520, DE-520 2010-10-05T14:42:39Z epn:3336183545
spellingShingle Berg, Mark, Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I, Lecture notes in computer science, 6346, Invited Talk -- The Robustness of Level Sets -- Session 1a -- Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods -- Non-clairvoyant Speed Scaling for Weighted Flow Time -- A Robust PTAS for Machine Covering and Packing -- Session 1b -- Balancing Degree, Diameter and Weight in Euclidean Spanners -- Testing Euclidean Spanners -- Fast Approximation in Subspaces by Doubling Metric Decomposition -- f-Sensitivity Distance Oracles and Routing Schemes -- Session 2a -- Fast Minor Testing in Planar Graphs -- On the Number of Spanning Trees a Planar Graph Can Have -- Contractions of Planar Graphs in Polynomial Time -- Session 2b -- Communication Complexity of Quasirandom Rumor Spreading -- A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing -- Contribution Games in Social Networks -- Session 3a -- Improved Bounds for Online Stochastic Matching -- Online Stochastic Packing Applied to Display Ad Allocation -- Caching Is Hard – Even in the Fault Model -- Session 3b -- Superselectors: Efficient Constructions and Applications -- Estimating the Average of a Lipschitz-Continuous Function from One Sample -- Streaming Graph Computations with a Helpful Advisor -- Session 4a -- Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier -- Minimum Vertex Cover in Rectangle Graphs -- Feedback Vertex Sets in Tournaments -- Session 4b -- n-Level Graph Partitioning -- Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns -- Finding the Diameter in Real-World Graphs -- Session 5a -- Budgeted Red-Blue Median and Its Generalizations -- All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables -- Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems -- Robust Algorithms for Sorting Railway Cars -- Session 5b -- Cloning Voronoi Diagrams via Retroactive Data Structures -- A Unified Approach to Approximate Proximity Searching -- Spatio-temporal Range Searching over Compressed Kinetic Sensor Data -- Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space -- Invited Talk -- Local Graph Exploration and Fast Property Testing -- Session 6a -- A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings -- Fast Prefix Search in Little Space, with Applications -- On the Huffman and Alphabetic Tree Problem with General Cost Functions -- Medium-Space Algorithms for Inverse BWT -- Session 6b -- Median Trajectories -- Optimal Cover of Points by Disks in a Simple Polygon -- Stability of ?-Kernels -- The Geodesic Diameter of Polygonal Domains -- Session 7a -- Polyhedral and Algorithmic Properties of Quantified Linear Programs -- Approximating Parameterized Convex Optimization Problems -- Approximation Schemes for Multi-Budgeted Independence Systems -- Session 7b -- Algorithmic Meta-theorems for Restrictions of Treewidth -- Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus -- Constructing the R* Consensus Tree of Two Trees in Subcubic Time., Computer Communication Networks, Data structures (Computer science), Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Computer graphics, Computer networks ., Software engineering., Discrete mathematics., Algorithms., Numerical analysis.
swb_id_str 330929453
title Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I
title_auth Algorithms – ESA 2010 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I
title_full Algorithms – ESA 2010 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I edited by Mark Berg, Ulrich Meyer
title_fullStr Algorithms – ESA 2010 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I edited by Mark Berg, Ulrich Meyer
title_full_unstemmed Algorithms – ESA 2010 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I edited by Mark Berg, Ulrich Meyer
title_in_hierarchy 6346. Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I (2010)
title_short Algorithms – ESA 2010
title_sort algorithms esa 2010 18th annual european symposium liverpool uk september 6 8 2010 proceedings part i
title_sub 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I
title_unstemmed Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I
topic Computer Communication Networks, Data structures (Computer science), Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Computer graphics, Computer networks ., Software engineering., Discrete mathematics., Algorithms., Numerical analysis.
topic_facet Computer Communication Networks, Data structures (Computer science), Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Computer graphics, Computer networks ., Software engineering., Discrete mathematics., Algorithms., Numerical analysis.
url https://doi.org/10.1007/978-3-642-15775-2, https://zbmath.org/?q=an:1194.68069, http://dx.doi.org/10.1007/978-3-642-15775-2