7 papers
Privacy Attacks on Stable Marriage
Stephan A. Fahrenkrog-Petersen, Aleksander Figiel, Darya Melnyk +2
The stable marriage problem appears in many privacy-sensitive domains, for example in the National Resident Matching Program in the US. In such applications, preserving the privacy…
SpiderDAN: Matching Augmentation in Demand-Aware Networks
Aleksander Figiel, Darya Melnyk, André Nichterlein +2
Graph augmentation is a fundamental and well-studied problem that arises in network optimization. We consider a new variant of this model motivated by reconfigurable communication…
Demand-Aware Network Design with Steiner Nodes and a Connection to Virtual Network Embedding
Aleksander Figiel, Janne H. Korhonen, Neil Olver +1
Emerging optical and virtualization technologies enable the design of more flexible and demand-aware networked systems, in which resources can be optimized toward the actual worklo…
Correlating Theory and Practice in Finding Clubs and Plexes
Aleksander Figiel, Tomohiro Koana, André Nichterlein +1
Finding large "cliquish" subgraphs is a classic NP-hard graph problem. In this work, we focus on finding maximum -clubs and -plexes, i.e., graphs of diameter and graphs w…
There and Back Again: On Applying Data Reduction Rules by Undoing Others
Aleksander Figiel, Vincent Froese, André Nichterlein +1
Data reduction rules are an established method in the algorithmic toolbox for tackling computationally challenging problems. A data reduction rule is a polynomial-time algorithm th…
Optimal Virtual Network Embeddings for Tree Topologies
Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier +3
The performance of distributed and data-centric applications often critically depends on the interconnecting network. Applications are hence modeled as virtual networks, also accou…
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering
Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein +1
Editing a graph into a disjoint union of clusters is a standard optimization task in graph-based data clustering. Here, complementing classic work where the clusters shall be cliqu…