Reconstruction of Weakly Simple Polygons from their Edges (Englisch)
Freier Zugriff
- Neue Suche nach: Akitaya, Hugo A.
- Neue Suche nach: Tóth, Csaba D.
- Neue Suche nach: Akitaya, Hugo A.
- Neue Suche nach: Tóth, Csaba D.
- Neue Suche nach: Hong, Seok-Hee
In:
LIPIcs, Volume 64, ISAAC 2016
: 27th International Symposium on Algorithms and Computation (ISAAC 2016)
;
64
;
10:1-10:13
;
2016
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Elektronische Ressource
-
Titel:Reconstruction of Weakly Simple Polygons from their Edges
-
Beteiligte:
-
Erschienen in:LIPIcs, Volume 64, ISAAC 2016 : 27th International Symposium on Algorithms and Computation (ISAAC 2016) ; 64 ; 10:1-10:13Leibniz International Proceedings in Informatics (LIPIcs) ; 64 ; 10:1-10:13
-
Verlag:
- Neue Suche nach: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Erscheinungsdatum:07.12.2016
-
Format / Umfang:13 pages , 560939 byte
-
Anmerkungen:LIPIcs, Vol. 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016), pages 10:1-10:13
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Lizenzbestimmungen:
-
Datenquelle:
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Towards Processing of Big Graphs: from Theory, Algorithm to System (Invited Talk)Lin, Xuemin et al. | 2016
- 2
-
Compressed and Searchable Indexes for Highly Similar Strings (Invited Talk)Park, Kunsoo et al. | 2016
- 3
-
Streaming Verification of Graph PropertiesAbdullah, Amirali / Daruki, Samira / Roy, Chitradeep Dutta / Venkatasubramanian, Suresh et al. | 2016
- 4
-
Building Clusters with Lower-Bounded SizesAbu-Khzam, Faisal / Bazgan, Cristina / Casel, Katrin / Fernau, Henning et al. | 2016
- 5
-
Simultaneous Feedback Edge Set: A Parameterized PerspectiveAgrawal, Akanksha / Panolan, Fahad / Saurabh, Saket / Zehavi, Meirav et al. | 2016
- 6
-
Kernels for Deletion to Classes of Acyclic DigraphsAgrawal, Akanksha / Saurabh, Saket / Sharma, Roohani / Zehavi, Meirav et al. | 2016
- 7
-
An Efficient Algorithm for Placing Electric Vehicle Charging StationsAgarwal, Pankaj K. / Pan, Jiangwei / Victor, Will et al. | 2016
- 8
-
Finding k Simple Shortest Paths and CyclesAgarwal, Udit / Ramachandran, Vijaya et al. | 2016
- 9
-
Packing Short Plane Spanning Trees in Complete Geometric GraphsAichholzer, Oswin / Hackl, Thomas / Korman, Matias / Pilz, Alexander / Rote, Günter / van Renssen, André / Roeloffzen, Marcel / Vogtenhuber, Birgit et al. | 2016
- 10
-
Reconstruction of Weakly Simple Polygons from their EdgesAkitaya, Hugo A. / Tóth, Csaba D. et al. | 2016
- 11
-
Approximating Smallest Containers for Packing Three-Dimensional Convex ObjectsAlt, Helmut / Scharf, Nadja et al. | 2016
- 12
-
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One GapAmir, Amihood / Kopelowitz, Tsvi / Levy, Avivit / Pettie, Seth / Porat, Ely / Shalom, B. Riva et al. | 2016
- 13
-
Clustered Planarity with PipesAngelini, Patrizio / Da Lozzo, Giordano et al. | 2016
- 14
-
L_1 Geodesic Farthest Neighbors in a Simple Polygon and Related ProblemsBae, Sang Won et al. | 2016
- 15
-
Approximate Clustering via Metric PartitioningBandyapadhyay, Sayan / Varadarajan, Kasturi et al. | 2016
- 16
-
Hard Communication Channels for SteganographyBerndt, Sebastian / Liskiewicz, Maciej et al. | 2016
- 17
-
On r-Guarding Thin Orthogonal PolygonsBiedl, Therese / Mehrabi, Saeed et al. | 2016
- 18
-
Dynamic Relative Compression, Dynamic Partial Sums, and Substring ConcatenationBille, Philip / Cording, Patrick Hagge / Gørtz, Inge Li / Skjoldjensen, Frederik Rye / Vildhøj, Hjalte Wedel / Vind, Søren et al. | 2016
- 19
-
Towards Plane Spanners of Degree 3Biniaz, Ahmad / Bose, Prosenjit / De Carufel, Jean-Lou / Gavoille, Cyril / Maheshwari, Anil / Smid, Michiel et al. | 2016
- 20
-
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized ComplexityBodlaender, Hans L. / Ono, Hirotaka / Otachi, Yota et al. | 2016
- 21
-
Online Packet Scheduling with Bounded Delay and LookaheadBöhm, Martin / Chrobak, Marek / Jez, Lukasz / Li, Fei / Sgall, Jirí / Veselý, Pavel et al. | 2016
- 22
-
Biconnectivity, Chain Decomposition and st-Numbering Using O(n) BitsChakraborty, Sankardeep / Raman, Venkatesh / Satti, Srinivasa Rao et al. | 2016
- 23
-
On (1, epsilon)-Restricted Max-Min Fair Allocation ProblemChan, T-H. Hubert / Tang, Zhihao Gavin / Wu, Xiaowei et al. | 2016
- 24
-
All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic TimeChan, Timothy M. / Skrepetos, Dimitrios et al. | 2016
- 25
-
Sink Evacuation on Trees with Dynamic Confluent FlowsChen, Di / Golin, Mordecai et al. | 2016
- 26
-
Adaptivity vs. Postselection, and Hardness Amplification for Polynomial ApproximationChen, Lijie et al. | 2016
- 27
-
Search on a Line by Byzantine RobotsCzyzowicz, Jurek / Georgiou, Konstantinos / Kranakis, Evangelos / Krizanc, Danny / Narayanan, Lata / Opatrny, Jaroslav / Shende, Sunil et al. | 2016
- 28
-
Bipartite Matching with Linear Edge WeightsDomanic, Nevzat Onur / Lam, Chi-Kit / Plaxton, C. Gregory et al. | 2016
- 29
-
Raising Permutations to Powers in PlaceEl-Zein, Hicham / Munro, J. Ian / Robertson, Matthew et al. | 2016
- 30
-
Space-Efficient Plane-Sweep AlgorithmsElmasry, Amr / Kammer, Frank et al. | 2016
- 31
-
Linear Kernels and Linear-Time Algorithms for Finding Large CutsEtscheid, Michael / Mnich, Matthias et al. | 2016
- 32
-
Universal Guard ProblemsFekete, Sándor P. / Li, Qian / Mitchell, Joseph S. B. / Scheffer, Christian et al. | 2016
- 33
-
Fast Approximation Algorithms for the Generalized Survivable Network Design ProblemFeldmann, Andreas Emil / Könemann, Jochen / Pashkovich, Kanstantsin / Sanità, Laura et al. | 2016
- 34
-
Space-Time Trade-Offs for the Shortest Unique Substring ProblemGanguly, Arnab / Hon, Wing-Kai / Shah, Rahul / Thankachan, Sharma V. et al. | 2016
- 35
-
The Subset Assignment Problem for Data Placement in CachesGhandeharizadeh, Shahram / Irani, Sandy / Lam, Jenny et al. | 2016
- 36
-
A Gap Trichotomy for Boolean Constraint Problems: Extending Schaefer's TheoremHam, Lucy et al. | 2016
- 37
-
Sliding Tokens on a CactusHoang, Duc A. / Uehara, Ryuhei et al. | 2016
- 38
-
Complexity of Distributions and Average-Case HardnessItsykson, Dmitry / Knop, Alexander / Sokolov, Dmitry et al. | 2016
- 39
-
Computing the Pattern Waiting Time: A Revisit of the Intuitive ApproachJin, Kai et al. | 2016
- 40
-
O(f) Bi-Approximation for Capacitated Covering with Hard CapacitiesKao, Mong-Jen / Tu, Hai-Lun / Lee, D. T. et al. | 2016
- 41
-
Surrogate Optimization for p-NormsKawase, Yasushi / Makino, Kazuhisa et al. | 2016
- 42
-
Optimal Composition Ordering Problems for Piecewise Linear FunctionsKawase, Yasushi / Makino, Kazuhisa / Seimi, Kento et al. | 2016
- 43
-
Additive Approximation Algorithms for Modularity MaximizationKawase, Yasushi / Matsui, Tomomi / Miyauchi, Atsushi et al. | 2016
- 44
-
The Densest Subgraph Problem with a Convex/Concave Size FunctionKawase, Yasushi / Miyauchi, Atsushi et al. | 2016
- 45
-
On the Classes of Interval Graphs of Limited Nesting and Count of LengthsKlavík, Pavel / Otachi, Yota / Šejnoha, Jiri et al. | 2016
- 46
-
Pattern Matching and Consensus Problems on Weighted Sequences and ProfilesKociumaka, Tomasz / Pissis, Solon P. / Radoszewski, Jakub et al. | 2016
- 47
-
Hierarchical Time-Dependent OraclesKontogiannis, Spyros / Wagner, Dorothea / Zaroliagis, Christos et al. | 2016
- 48
-
A Refined Definition for Groups of Moving Entities and its Computationvan Kreveld, Marc / Löffler, Maarten / Staals, Frank / Wiratma, Lionov et al. | 2016
- 49
-
A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed GraphKurz, Denis / Mutzel, Petra et al. | 2016
- 50
-
On the Complexity of Matching Cut in Graphs of Fixed DiameterLe, Hoang-Oanh / Le, Van Bang et al. | 2016
- 51
-
On the Optimality of Tape Merge of Two Lists with Similar SizeLi, Qian / Sun, Xiaoming / Zhang, Jialin et al. | 2016
- 52
-
Dispersing Points on IntervalsLi, Shimin / Wang, Haitao et al. | 2016
- 53
-
Optimal Nonpreemptive Scheduling in a Smart Grid ModelLiu, Fu-Hong / Liu, Hsiang-Hsuan / Wong, Prudence W. H. et al. | 2016
- 54
-
Distributed and Robust Support Vector MachineLiu, Yangwei / Ding, Hu / Huang, Ziyun / Xu, Jinhui et al. | 2016
- 55
-
Single Machine Scheduling with Job-Dependent Machine DeteriorationLuo, Wenchang / Xu, Yao / Tong, Weitian / Lin, Guohui et al. | 2016
- 56
-
Approximation Algorithms for Capacitated k-Travelling Repairmen ProblemsMartin, Christopher S. / Salavatipour, Mohammad R. et al. | 2016
- 57
-
Scaling and Proximity Properties of Integrally Convex FunctionsMoriguchi, Satoko / Murota, Kazuo / Tamura, Akihisa / Tardella, Fabio et al. | 2016
- 58
-
Assigning Weights to Minimize the Covering Radius in the PlaneOh, Eunjin / Ahn, Hee-Kap et al. | 2016
- 59
-
A Near-Optimal Algorithm for Finding an Optimal Shortcut of a TreeOh, Eunjin / Ahn, Hee-Kap et al. | 2016
- 60
-
Approximate Shortest Distances Among Smooth Obstacles in 3DScheffer, Christian / Vahrenhold, Jan et al. | 2016
- 61
-
An Improved Tax Scheme for Selfish RoutingWang, Te-Li / Yeh, Chih-Kuan / Chen, Ho-Lin et al. | 2016
- 62
-
A Linear-Time Algorithm for Integral Multiterminal Flows in TreesXiao, Mingyu / Nagamochi, Hiroshi et al. | 2016
- 63
-
Shortest Disjoint S-Paths Via Weighted Linear Matroid ParityYamaguchi, Yutaro et al. | 2016
- 64
-
The (1|1)-Centroid Problem on the Plane Concerning Distance ConstraintsYu, Hung-I / Lin, Tien-Ching / Lee, Der-Tsai et al. | 2016