<h2>LIPIcs, Volume 92, ISAAC 2017</h2>
<ul>
<li>
<span class="authors">Yoshio Okamoto and Takeshi Tokuyama</span>
<span class="title">LIPIcs, Volume 92, ISAAC'17, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017">10.4230/LIPIcs.ISAAC.2017</a>
</li>
<li>
<span class="authors">Yoshio Okamoto and Takeshi Tokuyama</span>
<span class="title">Front Matter, Table of Contents, Preface, External Reviewers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.0">10.4230/LIPIcs.ISAAC.2017.0</a>
</li>
<li>
<span class="authors">Satoru Iwata</span>
<span class="title">Weighted Linear Matroid Parity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.1">10.4230/LIPIcs.ISAAC.2017.1</a>
</li>
<li>
<span class="authors">Suresh Venkatasubramanian</span>
<span class="title">Computational Philosophy: On Fairness in Automated Decision Making</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.2">10.4230/LIPIcs.ISAAC.2017.2</a>
</li>
<li>
<span class="authors">Hee-Kap Ahn, Sang Won Bae, Jongmin Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, and Antoine Vigneron</span>
<span class="title">Faster Algorithms for Growing Prioritized Disks and Rectangles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.3">10.4230/LIPIcs.ISAAC.2017.3</a>
</li>
<li>
<span class="authors">Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, and Fabian Stehn</span>
<span class="title">Placing your Coins on a Shelf</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.4">10.4230/LIPIcs.ISAAC.2017.4</a>
</li>
<li>
<span class="authors">Kazuyuki Amano and Yoshinobu Haruyama</span>
<span class="title">On the Number of p4-Tilings by an n-Omino</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.5">10.4230/LIPIcs.ISAAC.2017.5</a>
</li>
<li>
<span class="authors">Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, and Joseph S. B. Mitchell</span>
<span class="title">Network Optimization on Partitioned Pairs of Points</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.6">10.4230/LIPIcs.ISAAC.2017.6</a>
</li>
<li>
<span class="authors">Franz Aurenhammer, Bert Jüttler, and Günter Paulini</span>
<span class="title">Voronoi Diagrams for Parallel Halflines and Line Segments in Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.7">10.4230/LIPIcs.ISAAC.2017.7</a>
</li>
<li>
<span class="authors">Maxim Babenko and Stepan Artamonov</span>
<span class="title">Faster Algorithms for Half-Integral T-Path Packing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.8">10.4230/LIPIcs.ISAAC.2017.8</a>
</li>
<li>
<span class="authors">Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, and Christos Levcopoulos</span>
<span class="title">Shortcuts for the Circle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.9">10.4230/LIPIcs.ISAAC.2017.9</a>
</li>
<li>
<span class="authors">Bahareh Banyassady, Man-Kwun Chiu, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, and Max Willert</span>
<span class="title">Routing in Polygonal Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.10">10.4230/LIPIcs.ISAAC.2017.10</a>
</li>
<li>
<span class="authors">Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Christian Rieck, Christian Scheffer, and Arne Schmidt</span>
<span class="title">Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.11">10.4230/LIPIcs.ISAAC.2017.11</a>
</li>
<li>
<span class="authors">Edvin Berglin and Gerth Stølting Brodal</span>
<span class="title">A Simple Greedy Algorithm for Dynamic Graph Orientation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.12">10.4230/LIPIcs.ISAAC.2017.12</a>
</li>
<li>
<span class="authors">Therese Biedl, Markus Chimani, Martin Derka, and Petra Mutzel</span>
<span class="title">Crossing Number for Graphs with Bounded~Pathwidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.13">10.4230/LIPIcs.ISAAC.2017.13</a>
</li>
<li>
<span class="authors">Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, and Guido Proietti</span>
<span class="title">An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.14">10.4230/LIPIcs.ISAAC.2017.14</a>
</li>
<li>
<span class="authors">Etienne Birmelé, Fabien de Montgolfier, Léo Planche, and Laurent Viennot</span>
<span class="title">Decomposing a Graph into Shortest Paths with Bounded Eccentricity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.15">10.4230/LIPIcs.ISAAC.2017.15</a>
</li>
<li>
<span class="authors">Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, and Daniël Paulusma</span>
<span class="title">Independent Feedback Vertex Set for P_5-free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.16">10.4230/LIPIcs.ISAAC.2017.16</a>
</li>
<li>
<span class="authors">Vincenzo Bonifaci</span>
<span class="title">On the Convergence Time of a Natural Dynamics for Linear Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.17">10.4230/LIPIcs.ISAAC.2017.17</a>
</li>
<li>
<span class="authors">Prosenjit Bose, Matias Korman, André van Renssen, and Sander Verdonschot</span>
<span class="title">Routing on the Visibility Graph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.18">10.4230/LIPIcs.ISAAC.2017.18</a>
</li>
<li>
<span class="authors">Gruia Calinescu, Florian Jaehn, Minming Li, and Kai Wang</span>
<span class="title">An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.19">10.4230/LIPIcs.ISAAC.2017.19</a>
</li>
<li>
<span class="authors">Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, and Peter Rossmanith</span>
<span class="title">An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.20">10.4230/LIPIcs.ISAAC.2017.20</a>
</li>
<li>
<span class="authors">Lin Chen, Lei Xu, Zhimin Gao, Nolan Shah, Yang Lu, and Weidong Shi</span>
<span class="title">Smart Contract Execution - the (+-)-Biased Ballot Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.21">10.4230/LIPIcs.ISAAC.2017.21</a>
</li>
<li>
<span class="authors">Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes</span>
<span class="title">Study of a Combinatorial Game in Graphs Through Linear Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.22">10.4230/LIPIcs.ISAAC.2017.22</a>
</li>
<li>
<span class="authors">Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, and Kunihiro Wasa</span>
<span class="title">On Maximal Cliques with Connectivity Constraints in Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.23">10.4230/LIPIcs.ISAAC.2017.23</a>
</li>
<li>
<span class="authors">Giordano Da Lozzo, William E. Devanny, David Eppstein, and Timothy Johnson</span>
<span class="title">Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.24">10.4230/LIPIcs.ISAAC.2017.24</a>
</li>
<li>
<span class="authors">Mark de Berg, Ade Gunawan, and Marcel Roeloffzen</span>
<span class="title">Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.25">10.4230/LIPIcs.ISAAC.2017.25</a>
</li>
<li>
<span class="authors">Mark de Berg, Tim Leijsen, Aleksandar Markovic, André van Renssen, Marcel Roeloffzen, and Gerhard Woeginger</span>
<span class="title">Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.26">10.4230/LIPIcs.ISAAC.2017.26</a>
</li>
<li>
<span class="authors">Mark de Berg and Aleksandar Markovic</span>
<span class="title">Dynamic Conflict-Free Colorings in the Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.27">10.4230/LIPIcs.ISAAC.2017.27</a>
</li>
<li>
<span class="authors">Tamal K. Dey, Alfred Rossi, and Anastasios Sidiropoulos</span>
<span class="title">Temporal Hierarchical Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.28">10.4230/LIPIcs.ISAAC.2017.28</a>
</li>
<li>
<span class="authors">Ning Ding</span>
<span class="title">Agnostically Learning Boolean Functions with Finite Polynomial Representation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.29">10.4230/LIPIcs.ISAAC.2017.29</a>
</li>
<li>
<span class="authors">Hicham El-Zein, J. Ian Munro, and Yakov Nekrich</span>
<span class="title">Succinct Color Searching in One Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.30">10.4230/LIPIcs.ISAAC.2017.30</a>
</li>
<li>
<span class="authors">Sándor P. Fekete and Phillip Keldenich</span>
<span class="title">Conflict-Free Coloring of Intersection Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.31">10.4230/LIPIcs.ISAAC.2017.31</a>
</li>
<li>
<span class="authors">Casper Benjamin Freksen and Kasper Green Larsen</span>
<span class="title">On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.32">10.4230/LIPIcs.ISAAC.2017.32</a>
</li>
<li>
<span class="authors">Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda</span>
<span class="title">Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.33">10.4230/LIPIcs.ISAAC.2017.33</a>
</li>
<li>
<span class="authors">Radoslav Fulek</span>
<span class="title">Embedding Graphs into Embedded Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.34">10.4230/LIPIcs.ISAAC.2017.34</a>
</li>
<li>
<span class="authors">Arnab Ganguly, Rahul Shah, and Sharma V. Thankachan</span>
<span class="title">Structural Pattern Matching - Succinctly</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.35">10.4230/LIPIcs.ISAAC.2017.35</a>
</li>
<li>
<span class="authors">Robert Ganian, Sebastian Ordyniak, and Ramanujan Sridharan</span>
<span class="title">On Structural Parameterizations of the Edge Disjoint Paths Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.36">10.4230/LIPIcs.ISAAC.2017.36</a>
</li>
<li>
<span class="authors">Serge Gaspers, Joachim Gudmundsson, Julián Mestre, and Stefan Rümmele</span>
<span class="title">Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.37">10.4230/LIPIcs.ISAAC.2017.37</a>
</li>
<li>
<span class="authors">Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, and Paolo Penna</span>
<span class="title">Sorting with Recurrent Comparison Errors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.38">10.4230/LIPIcs.ISAAC.2017.38</a>
</li>
<li>
<span class="authors">Omer Gold and Micha Sharir</span>
<span class="title">Dominance Product and High-Dimensional Closest Pair under L_infty</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.39">10.4230/LIPIcs.ISAAC.2017.39</a>
</li>
<li>
<span class="authors">Isaac Goldstein, Moshe Lewenstein, and Ely Porat</span>
<span class="title">Orthogonal Vectors Indexing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.40">10.4230/LIPIcs.ISAAC.2017.40</a>
</li>
<li>
<span class="authors">Mordecai J. Golin, Hadi Khodabande, and Bo Qin</span>
<span class="title">Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.41">10.4230/LIPIcs.ISAAC.2017.41</a>
</li>
<li>
<span class="authors">Joachim Gudmundsson and Rasmus Pagh</span>
<span class="title">Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.42">10.4230/LIPIcs.ISAAC.2017.42</a>
</li>
<li>
<span class="authors">Michel Habib and Lalla Mouatadid</span>
<span class="title">Maximum Induced Matching Algorithms via Vertex Ordering Characterizations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.43">10.4230/LIPIcs.ISAAC.2017.43</a>
</li>
<li>
<span class="authors">Torben Hagerup and Frank Kammer</span>
<span class="title">On-the-Fly Array Initialization in Less Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.44">10.4230/LIPIcs.ISAAC.2017.44</a>
</li>
<li>
<span class="authors">Tesshu Hanaka, Naomi Nishimura, and Hirotaka Ono</span>
<span class="title">On Directed Covering and Domination Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.45">10.4230/LIPIcs.ISAAC.2017.45</a>
</li>
<li>
<span class="authors">Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, and Yushi Uno</span>
<span class="title">Settlement Fund Circulation Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.46">10.4230/LIPIcs.ISAAC.2017.46</a>
</li>
<li>
<span class="authors">Ziyun Huang and Jinhui Xu</span>
<span class="title">An Efficient Sum Query Algorithm for Distance-based Locally Dominating Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.47">10.4230/LIPIcs.ISAAC.2017.47</a>
</li>
<li>
<span class="authors">Takehiro Ito, Naonori Kakimura, and Yusuke Kobayashi</span>
<span class="title">Complexity of the Multi-Service Center Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.48">10.4230/LIPIcs.ISAAC.2017.48</a>
</li>
<li>
<span class="authors">Hamidreza Jahanjou, Erez Kantor, and Rajmohan Rajaraman</span>
<span class="title">Improved Algorithms for Scheduling Unsplittable Flows on Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.49">10.4230/LIPIcs.ISAAC.2017.49</a>
</li>
<li>
<span class="authors">Ioannis Katsikarelis, Michael Lampis, and Vangelis Th. Paschos</span>
<span class="title">Structural Parameters, Tight Bounds, and Approximation for (k,r)-Center</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.50">10.4230/LIPIcs.ISAAC.2017.50</a>
</li>
<li>
<span class="authors">Yasushi Kawase, Kei Kimura, Kazuhisa Makino, and Hanna Sumita</span>
<span class="title">Optimal Matroid Partitioning Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.51">10.4230/LIPIcs.ISAAC.2017.51</a>
</li>
<li>
<span class="authors">Koji M. Kobayashi</span>
<span class="title">Improved Bounds for Online Dominating Sets of Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.52">10.4230/LIPIcs.ISAAC.2017.52</a>
</li>
<li>
<span class="authors">Athanasios L. Konstantinidis and Charis Papadopoulos</span>
<span class="title">Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.53">10.4230/LIPIcs.ISAAC.2017.53</a>
</li>
<li>
<span class="authors">Irina Kostitsyna, Bettina Speckmann, and Kevin Verbeek</span>
<span class="title">Non-Crossing Geometric Steiner Arborescences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.54">10.4230/LIPIcs.ISAAC.2017.54</a>
</li>
<li>
<span class="authors">Jessica McClintock, Julián Mestre, and Anthony Wirth</span>
<span class="title">Precedence-Constrained Min Sum Set Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.55">10.4230/LIPIcs.ISAAC.2017.55</a>
</li>
<li>
<span class="authors">Shuichi Miyazaki and Kazuya Okamoto</span>
<span class="title">Jointly Stable Matchings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.56">10.4230/LIPIcs.ISAAC.2017.56</a>
</li>
<li>
<span class="authors">J. Ian Munro, Gonzalo Navarro, and Yakov Nekrich</span>
<span class="title">Fast Compressed Self-Indexes with Deterministic Linear-Time Construction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.57">10.4230/LIPIcs.ISAAC.2017.57</a>
</li>
<li>
<span class="authors">Atsuki Nagao, Kazuhisa Seto, and Junichi Teruyama</span>
<span class="title">Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.58">10.4230/LIPIcs.ISAAC.2017.58</a>
</li>
<li>
<span class="authors">Kengo Nakamura</span>
<span class="title">Fully Dynamic Connectivity Oracles under General Vertex Updates</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.59">10.4230/LIPIcs.ISAAC.2017.59</a>
</li>
<li>
<span class="authors">Eunjin Oh and Hee-Kap Ahn</span>
<span class="title">Finding Pairwise Intersections of Rectangles in a Query Rectangle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.60">10.4230/LIPIcs.ISAAC.2017.60</a>
</li>
<li>
<span class="authors">Eunjin Oh and Hee-Kap Ahn</span>
<span class="title">A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.61">10.4230/LIPIcs.ISAAC.2017.61</a>
</li>
<li>
<span class="authors">Hiroki Osawa, Akira Suzuki, Takehiro Ito, and Xiao Zhou</span>
<span class="title">Complexity of Coloring Reconfiguration under Recolorability Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.62">10.4230/LIPIcs.ISAAC.2017.62</a>
</li>
<li>
<span class="authors">Piotr Sankowski and Piotr Wygocki</span>
<span class="title">Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.63">10.4230/LIPIcs.ISAAC.2017.63</a>
</li>
<li>
<span class="authors">Jia-Yau Shiau, Mong-Jen Kao, Ching-Chi Lin, and D. T. Lee</span>
<span class="title">Tight Approximation for Partial Vertex Cover with Hard Capacities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.64">10.4230/LIPIcs.ISAAC.2017.64</a>
</li>
<li>
<span class="authors">Rustem Takhanov</span>
<span class="title">Hybrid VCSPs with Crisp and Valued Conservative Templates</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.65">10.4230/LIPIcs.ISAAC.2017.65</a>
</li>
<li>
<span class="authors">Yao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, and Peng Zhang</span>
<span class="title">A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.66">10.4230/LIPIcs.ISAAC.2017.66</a>
</li>
<li>
<span class="authors">Yu Yokoi</span>
<span class="title">Envy-free Matchings with Lower Quotas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2017.67">10.4230/LIPIcs.ISAAC.2017.67</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing