Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility (Englisch)
- Neue Suche nach: Nilsson, Bengt J.
- Weitere Informationen zu Nilsson, Bengt J.:
-
https://orcid.org/http://orcid.org/0000-0002-1342-8618
- Neue Suche nach: Orden, David
- Weitere Informationen zu Orden, David:
-
https://orcid.org/http://orcid.org/0000-0001-5403-8467
- Neue Suche nach: Palios, Leonidas
- Neue Suche nach: Seara, Carlos
- Weitere Informationen zu Seara, Carlos:
-
https://orcid.org/http://orcid.org/0000-0002-0095-1725
- Neue Suche nach: Żyliński, Paweł
- Weitere Informationen zu Żyliński, Paweł:
-
https://orcid.org/http://orcid.org/0000-0001-6378-7742
- Neue Suche nach: Kim, Donghyun
- Neue Suche nach: Uma, R. N.
- Neue Suche nach: Cai, Zhipeng
- Neue Suche nach: Lee, Dong Hoon
- Neue Suche nach: Nilsson, Bengt J.
- Weitere Informationen zu Nilsson, Bengt J.:
-
https://orcid.org/http://orcid.org/0000-0002-1342-8618
- Neue Suche nach: Orden, David
- Weitere Informationen zu Orden, David:
-
https://orcid.org/http://orcid.org/0000-0001-5403-8467
- Neue Suche nach: Palios, Leonidas
- Neue Suche nach: Seara, Carlos
- Weitere Informationen zu Seara, Carlos:
-
https://orcid.org/http://orcid.org/0000-0002-0095-1725
- Neue Suche nach: Żyliński, Paweł
- Weitere Informationen zu Żyliński, Paweł:
-
https://orcid.org/http://orcid.org/0000-0001-6378-7742
In:
Computing and Combinatorics
: 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings
;
Kapitel: 25
;
311-323
;
2020
- Aufsatz/Kapitel (Buch) / Elektronische Ressource
-
Titel:Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility
-
Weitere Titelangaben:Lect.Notes Computer
-
Beteiligte:Kim, Donghyun ( Herausgeber:in ) / Uma, R. N. ( Herausgeber:in ) / Cai, Zhipeng ( Herausgeber:in ) / Lee, Dong Hoon ( Herausgeber:in ) / Nilsson, Bengt J. ( Autor:in ) / Orden, David ( Autor:in ) / Palios, Leonidas ( Autor:in ) / Seara, Carlos ( Autor:in ) / Żyliński, Paweł ( Autor:in )
-
Kongress:International Computing and Combinatorics Conference ; 2020 ; Atlanta, GA, USA
-
Erschienen in:Computing and Combinatorics : 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings ; Kapitel: 25 ; 311-323Lecture Notes in Computer Science ; 12273 ; 311-323
-
Verlag:
- Neue Suche nach: Springer International Publishing
-
Erscheinungsort:Cham
-
Erscheinungsdatum:27.08.2020
-
Format / Umfang:13 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz/Kapitel (Buch)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
Inhaltsverzeichnis E-Book
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
-
Subspace Approximation with OutliersDeshpande, Amit / Pratap, Rameshwar et al. | 2020
- 2
-
Linear-Time Algorithms for Eliminating Claws in GraphsBonomo-Braberman, Flavia / Nascimento, Julliano R. / Oliveira, Fabiano S. / Souza, Uéverton S. / Szwarcfiter, Jayme L. et al. | 2020
- 3
-
A New Lower Bound for the Eternal Vertex Cover Number of GraphsBabu, Jasine / Prabhakaran, Veena et al. | 2020
- 4
-
Bounded-Degree Spanners in the Presence of Polygonal Obstaclesvan Renssen, André / Wong, Gladys et al. | 2020
- 5
-
End-Vertices of AT-free BigraphsGorzny, Jan / Huang, Jing et al. | 2020
- 6
-
Approaching Optimal Duplicate Detection in a Sliding WindowGéraud-Stewart, Rémi / Lombard-Platet, Marius / Naccache, David et al. | 2020
- 7
-
Computational Complexity Characterization of Protecting Elections from BriberyChen, Lin / Sunny, Ahmed / Xu, Lei / Xu, Shouhuai / Gao, Zhimin / Lu, Yang / Shi, Weidong / Shah, Nolan et al. | 2020
- 8
-
Coding with Noiseless Feedback over the Z-ChannelDeppe, Christian / Lebedev, Vladimir / Maringer, Georg / Polyanskii, Nikita et al. | 2020
- 9
-
Path-Monotonic Upward Drawings of GraphsHong, Seok-Hee / Nagamochi, Hiroshi et al. | 2020
- 10
-
Seamless Interpolation Between Contraction Hierarchies and Hub Labels for Fast and Space-Efficient Shortest Path Queries in Road NetworksFunke, Stefan et al. | 2020
- 11
-
Visibility Polygon Queries Among Dynamic Polygonal Obstacles in PlaneAgrawal, Sanjana / Inkulu, R. et al. | 2020
- 12
-
How Hard Is Completeness Reasoning for Conjunctive Queries?Liu, Xianmin / Li, Jianzhong / Li, Yingshu et al. | 2020
- 13
-
Imbalance Parameterized by Twin Cover RevisitedMisra, Neeldhara / Mittal, Harshil et al. | 2020
- 14
-
Local Routing in a Tree Metric 1-SpannerBrankovic, Milutin / Gudmundsson, Joachim / van Renssen, André et al. | 2020
- 15
-
Deep Specification Mining with AttentionCao, Zhi / Zhang, Nan et al. | 2020
- 16
-
Constructing Independent Spanning Trees in Alternating Group NetworksHuang, Jie-Fu / Hsieh, Sun-Yuan et al. | 2020
- 17
-
W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton DimensionBlum, Johannes et al. | 2020
- 18
-
An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the PlaneEades, Patrick / Mestre, Julián et al. | 2020
- 19
-
Quantum Speedup for the Minimum Steiner Tree ProblemMiyamoto, Masayuki / Iwamura, Masakazu / Kise, Koichi / Gall, François Le et al. | 2020
- 20
-
Access Structure Hiding Secret Sharing from Novel Set Systems and Vector FamiliesSehrawat, Vipin Singh / Desmedt, Yvo et al. | 2020
- 21
-
Approximation Algorithms for Car-Sharing ProblemsLuo, Kelin / Spieksma, Frits C. R. et al. | 2020
- 22
-
Realization Problems on Reachability SequencesDippel, Matthew / Sundaram, Ravi / Varma, Akshar et al. | 2020
- 23
-
Power of Decision Trees with Monotone QueriesAmireddy, Prashanth / Jayasurya, Sai / Sarma, Jayalal et al. | 2020
- 24
-
Computing a Maximum Clique in Geometric Superclasses of Disk GraphsGrelier, Nicolas et al. | 2020
- 25
-
Shortest Watchman Tours in Simple Polygons Under Rotated Monotone VisibilityNilsson, Bengt J. / Orden, David / Palios, Leonidas / Seara, Carlos / Żyliński, Paweł et al. | 2020
- 26
-
Tight Approximation for the Minimum Bottleneck Generalized Matching ProblemMestre, Julián / Moses, Nicolás E. Stier et al. | 2020
- 27
-
Graph Classes and Approximability of the Happy Set ProblemAsahiro, Yuichi / Eto, Hiroshi / Hanaka, Tesshu / Lin, Guohui / Miyano, Eiji / Terabaru, Ippei et al. | 2020
- 28
-
A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning SubgraphsBeyer, Stephan / Chimani, Markus / Spoerhase, Joachim et al. | 2020
- 29
-
Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix GamesGutin, Gregory / Neary, Philip R. / Yeo, Anders et al. | 2020
- 30
-
On the Enumeration of Minimal Non-pairwise Compatibility GraphsAzam, Naveed Ahmed / Shurbevski, Aleksandar / Nagamochi, Hiroshi et al. | 2020
- 31
-
Constructing Tree Decompositions of Graphs with Bounded GonalityBodlaender, Hans L. / van Dobben de Bruyn, Josse / Gijswijt, Dion / Smit, Harry et al. | 2020
- 32
-
Election Control Through Social Influence with Unknown PreferencesAbouei Mehrizi, Mohammad / Corò, Federico / Cruciani, Emilio / D’Angelo, Gianlorenzo et al. | 2020
- 33
-
k-Critical Graphs in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_5$$\end{document}-Free GraphsCameron, Kathie / Goedgebeur, Jan / Huang, Shenwei / Shi, Yongtang et al. | 2020
- 34
-
New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing ProblemHadj Salem, Khadija / Kieffer, Yann et al. | 2020
- 35
-
On the Area Requirements of Planar Greedy Drawings of Triconnected Planar GraphsDa Lozzo, Giordano / D’Angelo, Anthony / Frati, Fabrizio et al. | 2020
- 36
-
On the Restricted 1-Steiner Tree ProblemBose, Prosenjit / D’Angelo, Anthony / Durocher, Stephane et al. | 2020
- 37
-
Computational Complexity of Synchronization Under Regular Commutative ConstraintsHoffmann, Stefan et al. | 2020
- 38
-
Approximation Algorithms for General Cluster Routing ProblemZhang, Xiaoyan / Du, Donglei / Gutin, Gregory / Ming, Qiaoxia / Sun, Jian et al. | 2020
- 39
-
Hardness of Sparse Sets and Minimal Circuit Size ProblemFu, Bin et al. | 2020
- 40
-
Succinct Monotone Circuit Certification: Planarity and Parameterized ComplexityAlves, Mateus Rodrigues / de Oliveira Oliveira, Mateus / Silva, Janio Carlos Nascimento / dos Santos Souza, Uéverton et al. | 2020
- 41
-
On Measures of Space over Real and Complex NumbersPrakash, Om / Raghavendra Rao, B. V. et al. | 2020
- 42
-
Parallelized Maximization of Nonsubmodular Function Subject to a Cardinality ConstraintZhang, Hongxiang / Xu, Dachuan / Guo, Longkun / Tan, Jingjing et al. | 2020
- 43
-
An Improved Bregman k-means++ Algorithm via Local SearchTian, Xiaoyun / Xu, Dachuan / Guo, Longkun / Wu, Dan et al. | 2020
- 44
-
Approximating Maximum Acyclic Matchings by Greedy and Local Search StrategiesBaste, Julien / Fürst, Maximilian / Rautenbach, Dieter et al. | 2020
- 45
-
On the Complexity of Directed Intersection Representation of DAGsCaucchiolo, Andrea / Cicalese, Ferdinando et al. | 2020
- 46
-
On the Mystery of Negations in Circuits: Structure vs PowerAmireddy, Prashanth / Jayasurya, Sai / Sarma, Jayalal et al. | 2020
- 47
-
Even Better Fixed-Parameter Algorithms for Bicluster EditingLafond, Manuel et al. | 2020
- 48
-
Approximate Set Union via Approximate RandomizationFu, Bin / Gu, Pengfei / Zhao, Yuming et al. | 2020
- 49
-
A Non-Extendibility Certificate for Submodularity and ApplicationsBhaskar, Umang / Kumar, Gunjan et al. | 2020
- 50
-
Parameterized Complexity of Maximum Edge Colorable SubgraphAgrawal, Akanksha / Kundu, Madhumita / Sahu, Abhishek / Saurabh, Saket / Tale, Prafullkumar et al. | 2020
- 51
-
Approximation Algorithms for the Lower-Bounded k-Median and Its GeneralizationsHan, Lu / Hao, Chunlin / Wu, Chenchen / Zhang, Zhenning et al. | 2020
- 52
-
A Survey for Conditional Diagnosability of Alternating Group NetworksChang, Nai-Wen / Hsieh, Sun-Yuan et al. | 2020
- 53
-
Fixed Parameter Tractability of Graph Deletion Problems over Data StreamsBishnu, Arijit / Ghosh, Arijit / Kolay, Sudeshna / Mishra, Gopinath / Saurabh, Saket et al. | 2020
- 54
-
Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded SeparatorsBezáková, Ivona / Sun, Wenbo et al. | 2020