activity
20122022
most citedEdge Routing with Ordered Bundles

10 citations · 26 across the 10 of their papers we have counts for

collaborators

17 papers

cs.PL2022

Optimizing Function Layout for Mobile Applications

Ellis Hoag, Kyungwoo Lee, Julián Mestre +1

Function layout, also referred to as function reordering or function placement, is one of the most effective profile-guided compiler optimizations. By reordering functions in a bin…

cs.GT2022

Robust and fair work allocation

Amine Allouah, Christian Kroer, Xuan Zhang +6

In today's digital world, interaction with online platforms is ubiquitous, and thus content moderation is important for protecting users from content that do not comply with pre-es…

cs.AI2021

Matching Algorithms for Blood Donation

Duncan C McElfresh, Christian Kroer, Sergey Pupyrev +5

Global demand for donated blood far exceeds supply, and unmet need is greatest in low- and middle-income countries; experts suggest that large-scale coordination is necessary to al…

cs.DS2021

On the Extended TSP Problem

Julián Mestre, Sergey Pupyrev, Seeun William Umboh

We initiate the theoretical study of Ext-TSP, a problem that originates in the area of profile-guided binary optimization. Given a graph with positive edge weights $w: E…

cs.DS2021

The Mixed Page Number of Graphs

Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann +2

A linear layout of a graph typically consists of a total vertex order, and a partition of the edges into sets of either non-crossing edges, called stacks, or non-nested edges, call…

cs.DS2020

Lazy Queue Layouts of Posets

Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann +2

We investigate the queue number of posets in terms of their width, that is, the maximum number of pairwise incomparable elements. A long-standing conjecture of Heath and Pemmaraju…