3 citations · 3 across the 12 of their papers we have counts for
3 papers · 1 filter
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…
DecentPeeR: A Self-Incentivised & Inclusive Decentralized Peer Review System
Johannes Gruendler, Darya Melnyk, Arash Pourdamghani +1
Peer review, as a widely used practice to ensure the quality and integrity of publications, lacks a well-defined and common mechanism to self-incentivize virtuous behavior across a…
Learning Minimum Linear Arrangement of Cliques and Lines
Julien Dallot, Maciej Pacut, Marcin Bienkowski +2
In the well-known Minimum Linear Arrangement problem (MinLA), the goal is to arrange the nodes of an undirected graph into a permutation so that the total stretch of the edges is m…