Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIWOCA 2022: Trier, Germany
- Cristina Bazgan
, Henning Fernau:
Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings. Lecture Notes in Computer Science 13270, Springer 2022, ISBN 978-3-031-06677-1
Invited Papers
- Akanksha Agrawal, M. S. Ramanujan:
Distance from Triviality 2.0: Hybrid Parameterizations. 3-20 - Bhaskar Ray Chaudhury:
On the Existence of EFX Allocations. 21-27
Contributed Papers
- Sreshth Aggarwal, Deepanjan Kesh, Divyam Singal:
Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model. 31-45 - Oswin Aichholzer, Ruy Fabila Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber:
Perfect Matchings with Crossings. 46-59 - Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev:
Graph Parameters, Implicit Representations and Factorial Properties. 60-72 - Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis:
Approximating Subset Sum Ratio via Subset Sum Computations. 73-85 - Stepan Artamonov, Maxim A. Babenko:
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings. 86-100 - János Balogh, György Dósa, Leah Epstein, Lukasz Jez:
Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems. 101-113 - Avah Banerjee:
An Adjacency Labeling Scheme Based on a Decomposition of Trees into Caterpillars. 114-127 - Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi:
Computing Longest (Common) Lyndon Subsequences. 128-142 - Thaís Bardini Idalino, Lucia Moura:
Structure-Aware Combinatorial Group Testing: A New Method for Pandemic Screening. 143-156 - Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution. 157-171 - Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant:
1-Extendability of Independent Sets. 172-185 - Daniel Bertschinger, Jonas Passweg, Patrick Schnider:
Tukey Depth Histograms. 186-198 - Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer:
An Efficient Algorithm for the Proximity Connected Two Center Problem. 199-213 - Cristiano Bocci, Chiara Capresi, Kitty Meeks, John Sylvester:
A New Temporal Interpretation of Cluster Editing. 214-227 - Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski:
List Covering of Regular Multigraphs. 228-242 - Elisabet Burjons, Janosch Fuchs, Henri Lotze:
The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs. 243-256 - Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Uéverton S. Souza:
Perfect Matching Cuts Partitioning a Graph into Complementary Subgraphs. 257-269 - Andrea Caucchiolo, Ferdinando Cicalese:
On the Intractability Landscape of Digraph Intersection Representations. 270-284 - Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä:
The Red-Blue Separation Problem on Graphs. 285-298 - Pål Grønås Drange, Irene Muzi, Felix Reidl:
Harmless Sets in Sparse Classes. 299-312 - Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer:
The Parameterized Complexity of s-Club with Triangle and Seed Constraints. 313-326 - Tomohiro I, Dominik Köppl:
Space-Efficient B Trees via Load-Balancing. 327-340 - Asei Inoue, Yusuke Kobayashi:
An Additive Approximation Scheme for the Nash Social Welfare Maximization with Identical Additive Valuations. 341-354 - Joanna Kaczmarek, Jörg Rothe:
Controlling Weighted Voting Games by Deleting or Adding Players with or Without Changing the Quota. 355-368 - Sung-Hwan Kim, Hwan-Gue Cho:
Practical Space-Efficient Index for Structural Pattern Matching. 369-382 - Paul W. Lapey, Aaron Williams:
A Shift Gray Code for Fixed-Content Łukasiewicz Words. 383-397 - Jonas Lingg, Mateus de Oliveira Oliveira, Petra Wolf:
Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms. 398-411 - Felicia Lucke, Felix Mann:
Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number. 412-424 - Takuya Mieno, Mitsuru Funakoshi:
Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings. 425-438 - Soumen Nandi, Sagnik Sen, S. Taruni:
On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs. 439-450 - Thi Huyen Chau Nguyen, Werner Grass, Klaus Jansen:
Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks. 451-465 - Charis Papadopoulos, Spyridon Tzimas:
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage. 466-479 - Nicola Rizzo, Veli Mäkinen:
Linear Time Construction of Indexable Elastic Founder Graphs. 480-493 - Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
On Critical Node Problems with Vulnerable Vertices. 494-508 - Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono:
Winner Determination Algorithms for Graph Games with Matching Structures. 509-522
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-07-16 19:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
