LIPIcs, Volume 92, ISAAC'17, Complete Volume (Englisch)
Freier Zugriff
- Neue Suche nach: Okamoto, Yoshio
- Neue Suche nach: Tokuyama, Takeshi
- Neue Suche nach: Okamoto, Yoshio
- Neue Suche nach: Tokuyama, Takeshi
2017
-
ISBN:
-
ISSN:
- Konferenzband / Elektronische Ressource
-
Titel:LIPIcs, Volume 92, ISAAC'17, Complete Volume
-
Beteiligte:Okamoto, Yoshio ( Autor:in , Herausgeber:in ) / Tokuyama, Takeshi ( Autor:in , Herausgeber:in )
-
Erschienen in:
-
Verlag:
- Neue Suche nach: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Erscheinungsdatum:19.12.2017
-
Format / Umfang:856 pages , 42648036 byte
-
Anmerkungen:LIPIcs, Vol. 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017), pages 0-0
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Konferenzband
-
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
-
Weighted Linear Matroid ParityIwata, Satoru et al. | 2017
- 2
-
Computational Philosophy: On Fairness in Automated Decision MakingVenkatasubramanian, Suresh et al. | 2017
- 3
-
Faster Algorithms for Growing Prioritized Disks and RectanglesAhn, Hee-Kap / Bae, Sang Won / Choi, Jongmin / Korman, Matias / Mulzer, Wolfgang / Oh, Eunjin / Park, Ji-won / van Renssen, André / Vigneron, Antoine et al. | 2017
- 4
-
Placing your Coins on a ShelfAlt, Helmut / Buchin, Kevin / Chaplick, Steven / Cheong, Otfried / Kindermann, Philipp / Knauer, Christian / Stehn, Fabian et al. | 2017
- 5
-
On the Number of p4-Tilings by an n-OminoAmano, Kazuyuki / Haruyama, Yoshinobu et al. | 2017
- 6
-
Network Optimization on Partitioned Pairs of PointsArkin, Esther M. / Banik, Aritra / Carmi, Paz / Citovsky, Gui / Jia, Su / Katz, Matthew J. / Mayer, Tyler / Mitchell, Joseph S. B. et al. | 2017
- 7
-
Voronoi Diagrams for Parallel Halflines and Line Segments in SpaceAurenhammer, Franz / Jüttler, Bert / Paulini, Günter et al. | 2017
- 8
-
Faster Algorithms for Half-Integral T-Path PackingBabenko, Maxim / Artamonov, Stepan et al. | 2017
- 9
-
Shortcuts for the CircleBae, Sang Won / de Berg, Mark / Cheong, Otfried / Gudmundsson, Joachim / Levcopoulos, Christos et al. | 2017
- 10
-
Routing in Polygonal DomainsBanyassady, Bahareh / Chiu, Man-Kwun / Korman, Matias / Mulzer, Wolfgang / van Renssen, André / Roeloffzen, Marcel / Seiferth, Paul / Stein, Yannik / Vogtenhuber, Birgit / Willert, Max et al. | 2017
- 11
-
Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External ForcesBecker, Aaron T. / Fekete, Sándor P. / Keldenich, Phillip / Krupke, Dominik / Rieck, Christian / Scheffer, Christian / Schmidt, Arne et al. | 2017
- 12
-
A Simple Greedy Algorithm for Dynamic Graph OrientationBerglin, Edvin / Stølting Brodal, Gerth et al. | 2017
- 13
-
Crossing Number for Graphs with Bounded~PathwidthBiedl, Therese / Chimani, Markus / Derka, Martin / Mutzel, Petra et al. | 2017
- 14
-
An Improved Algorithm for Computing All the Best Swap Edges of a Tree SpannerBilò, Davide / Colella, Feliciano / Gualà, Luciano / Leucci, Stefano / Proietti, Guido et al. | 2017
- 15
-
Decomposing a Graph into Shortest Paths with Bounded EccentricityBirmelé, Etienne / de Montgolfier, Fabien / Planche, Léo / Viennot, Laurent et al. | 2017
- 16
-
Independent Feedback Vertex Set for P_5-free GraphsBonamy, Marthe / Dabrowski, Konrad K. / Feghali, Carl / Johnson, Matthew / Paulusma, Daniël et al. | 2017
- 17
-
On the Convergence Time of a Natural Dynamics for Linear ProgrammingBonifaci, Vincenzo et al. | 2017
- 18
-
Routing on the Visibility GraphBose, Prosenjit / Korman, Matias / van Renssen, André / Verdonschot, Sander et al. | 2017
- 19
-
An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position ConstraintCalinescu, Gruia / Jaehn, Florian / Li, Minming / Wang, Kai et al. | 2017
- 20
-
An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition ProblemChen, Li-Hsuan / Hsieh, Sun-Yuan / Hung, Ling-Ju / Rossmanith, Peter et al. | 2017
- 21
-
Smart Contract Execution - the (+-)-Biased Ballot ProblemChen, Lin / Xu, Lei / Gao, Zhimin / Shah, Nolan / Lu, Yang / Shi, Weidong et al. | 2017
- 22
-
Study of a Combinatorial Game in Graphs Through Linear ProgrammingCohen, Nathann / Mc Inerney, Fionn / Nisse, Nicolas / Pérennes, Stéphane et al. | 2017
- 23
-
On Maximal Cliques with Connectivity Constraints in Directed GraphsConte, Alessio / Kanté, Mamadou Moustapha / Uno, Takeaki / Wasa, Kunihiro et al. | 2017
- 24
-
Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested GraphsDa Lozzo, Giordano / Devanny, William E. / Eppstein, David / Johnson, Timothy et al. | 2017
- 25
-
Faster DBScan and HDBScan in Low-Dimensional Euclidean Spacesde Berg, Mark / Gunawan, Ade / Roeloffzen, Marcel et al. | 2017
- 26
-
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Pointsde Berg, Mark / Leijsen, Tim / Markovic, Aleksandar / van Renssen, André / Roeloffzen, Marcel / Woeginger, Gerhard et al. | 2017
- 27
-
Dynamic Conflict-Free Colorings in the Planede Berg, Mark / Markovic, Aleksandar et al. | 2017
- 28
-
Temporal Hierarchical ClusteringDey, Tamal K. / Rossi, Alfred / Sidiropoulos, Anastasios et al. | 2017
- 29
-
Agnostically Learning Boolean Functions with Finite Polynomial RepresentationDing, Ning et al. | 2017
- 30
-
Succinct Color Searching in One DimensionEl-Zein, Hicham / Munro, J. Ian / Nekrich, Yakov et al. | 2017
- 31
-
Conflict-Free Coloring of Intersection GraphsFekete, Sándor P. / Keldenich, Phillip et al. | 2017
- 32
-
On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss TransformsFreksen, Casper Benjamin / Larsen, Kasper Green et al. | 2017
- 33
-
Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded StringsFujishige, Yuta / Nakashima, Yuto / Inenaga, Shunsuke / Bannai, Hideo / Takeda, Masayuki et al. | 2017
- 34
-
Embedding Graphs into Embedded GraphsFulek, Radoslav et al. | 2017
- 35
-
Structural Pattern Matching - SuccinctlyGanguly, Arnab / Shah, Rahul / Thankachan, Sharma V. et al. | 2017
- 36
-
On Structural Parameterizations of the Edge Disjoint Paths ProblemGanian, Robert / Ordyniak, Sebastian / Sridharan, Ramanujan et al. | 2017
- 37
-
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate MovementsGaspers, Serge / Gudmundsson, Joachim / Mestre, Julián / Rümmele, Stefan et al. | 2017
- 38
-
Sorting with Recurrent Comparison ErrorsGeissmann, Barbara / Leucci, Stefano / Liu, Chih-Hung / Penna, Paolo et al. | 2017
- 39
-
Dominance Product and High-Dimensional Closest Pair under L_inftyGold, Omer / Sharir, Micha et al. | 2017
- 40
-
Orthogonal Vectors IndexingGoldstein, Isaac / Lewenstein, Moshe / Porat, Ely et al. | 2017
- 41
-
Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow ProblemsGolin, Mordecai J. / Khodabande, Hadi / Qin, Bo et al. | 2017
- 42
-
Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for PolygonsGudmundsson, Joachim / Pagh, Rasmus et al. | 2017
- 43
-
Maximum Induced Matching Algorithms via Vertex Ordering CharacterizationsHabib, Michel / Mouatadid, Lalla et al. | 2017
- 44
-
On-the-Fly Array Initialization in Less SpaceHagerup, Torben / Kammer, Frank et al. | 2017
- 45
-
On Directed Covering and Domination ProblemsHanaka, Tesshu / Nishimura, Naomi / Ono, Hirotaka et al. | 2017
- 46
-
Settlement Fund Circulation ProblemHayakawa, Hitoshi / Ishii, Toshimasa / Ono, Hirotaka / Uno, Yushi et al. | 2017
- 47
-
An Efficient Sum Query Algorithm for Distance-based Locally Dominating FunctionsHuang, Ziyun / Xu, Jinhui et al. | 2017
- 48
-
Complexity of the Multi-Service Center ProblemIto, Takehiro / Kakimura, Naonori / Kobayashi, Yusuke et al. | 2017
- 49
-
Improved Algorithms for Scheduling Unsplittable Flows on PathsJahanjou, Hamidreza / Kantor, Erez / Rajaraman, Rajmohan et al. | 2017
- 50
-
Structural Parameters, Tight Bounds, and Approximation for (k,r)-CenterKatsikarelis, Ioannis / Lampis, Michael / Paschos, Vangelis Th. et al. | 2017
- 51
-
Optimal Matroid Partitioning ProblemsKawase, Yasushi / Kimura, Kei / Makino, Kazuhisa / Sumita, Hanna et al. | 2017
- 52
-
Improved Bounds for Online Dominating Sets of TreesKobayashi, Koji M. et al. | 2017
- 53
-
Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval GraphsKonstantinidis, Athanasios L. / Papadopoulos, Charis et al. | 2017
- 54
-
Non-Crossing Geometric Steiner ArborescencesKostitsyna, Irina / Speckmann, Bettina / Verbeek, Kevin et al. | 2017
- 55
-
Precedence-Constrained Min Sum Set CoverMcClintock, Jessica / Mestre, Julián / Wirth, Anthony et al. | 2017
- 56
-
Jointly Stable MatchingsMiyazaki, Shuichi / Okamoto, Kazuya et al. | 2017
- 57
-
Fast Compressed Self-Indexes with Deterministic Linear-Time ConstructionMunro, J. Ian / Navarro, Gonzalo / Nekrich, Yakov et al. | 2017
- 58
-
Satisfiability Algorithm for Syntactic Read-$k$-times Branching ProgramsNagao, Atsuki / Seto, Kazuhisa / Teruyama, Junichi et al. | 2017
- 59
-
Fully Dynamic Connectivity Oracles under General Vertex UpdatesNakamura, Kengo et al. | 2017
- 60
-
Finding Pairwise Intersections of Rectangles in a Query RectangleOh, Eunjin / Ahn, Hee-Kap et al. | 2017
- 61
-
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off AlgorithmsOh, Eunjin / Ahn, Hee-Kap et al. | 2017
- 62
-
Complexity of Coloring Reconfiguration under Recolorability ConstraintsOsawa, Hiroki / Suzuki, Akira / Ito, Takehiro / Zhou, Xiao et al. | 2017
- 63
-
Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}Sankowski, Piotr / Wygocki, Piotr et al. | 2017
- 64
-
Tight Approximation for Partial Vertex Cover with Hard CapacitiesShiau, Jia-Yau / Kao, Mong-Jen / Lin, Ching-Chi / Lee, D. T. et al. | 2017
- 65
-
Hybrid VCSPs with Crisp and Valued Conservative TemplatesTakhanov, Rustem et al. | 2017
- 66
-
A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo ProblemXu, Yao / Chen, Yong / Lin, Guohui / Liu, Tian / Luo, Taibo / Zhang, Peng et al. | 2017
- 67
-
Envy-free Matchings with Lower QuotasYokoi, Yu et al. | 2017