Abstract is missing.
- Relaxed and Approximate Graph RealizationsAmotz Bar-Noy, Toni Böhnlein, David Peleg, Mor Perry, Dror Rawitz. 3-19 [doi]
- Search for Combinatorial Objects Using Lattice Algorithms - RevisitedAlfred Wassermann. 20-33 [doi]
- Linear Algorithms for Red and Blue Domination in Convex Bipartite GraphsNesrine Abbas. 37-48 [doi]
- Combinatorics and Algorithms for Quasi-chain GraphsBogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev. 49-62 [doi]
- Composed Degree-Distance Realizations of GraphsAmotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz. 63-77 [doi]
- All Subgraphs of a Wheel Are 5-Coupled-ChoosableSam Barr, Therese C. Biedl. 78-91 [doi]
- Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection GraphsSriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy. 92-106 [doi]
- Edge Exploration of Temporal GraphsBenjamin Merlin Bumpus, Kitty Meeks. 107-121 [doi]
- Optimal Monomial Quadratization for ODE SystemsAndrey Bychkov, Gleb Pogudin. 122-136 [doi]
- A Hamilton Cycle in the k-Sided Pancake NetworkB. Cameron, J. Sawada, A. Williams. 137-151 [doi]
- Algorithms and Complexity of s-Club Cluster Vertex DeletionDibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai. 152-164 [doi]
- Covering Convex Polygons by Two Congruent DisksJongmin Choi, Dahye Jeong, Hee-Kap Ahn. 165-178 [doi]
- The Tandem Duplication Distance Problem Is Hard over Bounded AlphabetsFerdinando Cicalese, Nicolò Pilati. 179-193 [doi]
- On the Oriented Coloring of the Disjoint Union of GraphsErika Morais Martins Coelho, Hebert Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sylvain Gravier, Sulamita Klein. 194-207 [doi]
- The Pony Express Communication ProblemJared Coleman, Evangelos Kranakis, Danny Krizanc, Oscar Morales Ponce. 208-222 [doi]
- Skyline Groups Are Ideals. An Efficient Algorithm for Enumerating Skyline GroupsSimon Coumes, Tassadit Bouadi, Lhouari Nourine, Alexandre Termier. 223-236 [doi]
- Vertex Cover at Distance on H-Free GraphsClément Dallard, Mirza Krbezlija, Martin Milanic. 237-251 [doi]
- On an Ordering Problem in Weighted HypergraphsPeter Damaschke. 252-264 [doi]
- An Efficient Noisy Binary Search in Graphs via Median ApproximationDariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski. 265-281 [doi]
- A Study on the Existence of Null Labelling for 3-HypergraphsNiccolò Di Marco, Andrea Frosini, William Lawrence Kocay. 282-294 [doi]
- Piercing All Translates of a Set of Axis-Parallel RectanglesAdrian Dumitrescu, Josef Tkadlec. 295-309 [doi]
- A Triangle Process on Regular GraphsColin Cooper, Martin E. Dyer, Catherine S. Greenhill. 310-323 [doi]
- Complexity and Algorithms for MUL-Tree PruningMathieu Gascon, Riccardo Dondi, Nadia El-Mabrouk. 324-339 [doi]
- Makespan Trade-Offs for Visiting Triangle Edges - (Extended Abstract)Konstantinos Georgiou, Somnath Kundu, Pawel Pralat. 340-355 [doi]
- Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber kToru Hasunuma. 356-369 [doi]
- Approximation Algorithms for Hitting SubgraphsNoah Brüstle, Tal Elbaz, Hamed Hatami, Onur Kocer, Bingchan Ma. 370-384 [doi]
- Isomorphic Unordered Labeled Trees up to Substitution CipheringFlorian Ingels, Romain Azaïs. 385-399 [doi]
- Intersecting Disks Using Two Congruent DisksByeonguk Kang, Jongmin Choi, Hee-Kap Ahn. 400-413 [doi]
- Disjoint Paths and Connected Subgraphs for H-Free GraphsWalter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen. 414-427 [doi]
- Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange PropertySoh Kumabe, Takanori Maehara. 428-441 [doi]
- Minimum Eccentricity Shortest Path Problem with Respect to Structural ParametersMartin Kucera, Ondrej Suchý. 442-455 [doi]
- Non-preemptive Tree PackingStefan Lendl, Gerhard J. Woeginger, Lasse Wulf. 456-468 [doi]
- Card-Based Cryptographic Protocols for Three-Input Functions Using Private OperationsYoshifumi Manabe, Hibiki Ono. 469-484 [doi]
- Königsberg Sightseeing: Eulerian Walks in Temporal GraphsAndrea Marino, Ana Silva. 485-500 [doi]
- Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid GraphsRahnuma Islam Nishat, Srinivasan Venkatesh 0001, Sue Whitesides. 501-515 [doi]
- New Approximations and Hardness Results for Submodular Partitioning ProblemsRichard Santiago. 516-530 [doi]
- An FPT Algorithm for Matching Cut and d-CutN. R. Aravind, Roopam Saxena. 531-543 [doi]
- Backtrack Search for Parallelisms of Projective SpacesSvetlana Topalova, Stela Zhelezova. 544-557 [doi]
- Approximating Multistage Matching ProblemsMarkus Chimani, Niklas Troost, Tilo Wiedera. 558-570 [doi]
- Heuristically Enhanced IPO Algorithms for Covering Array GenerationMichael Wagner, Ludwig Kampel, Dimitris E. Simos. 571-586 [doi]