1 citations · 2 across the 3 of their papers we have counts for
4 papers
A Constructive Proof of the Cycle Double Cover Conjecture
Alexander Souza
The cycle double cover conjecture states that a graph is bridge-free if and only if there is a family of edge-simple cycles such that each edge is contained in exactly two of them.…
Approximation Algorithms for Variable-Sized and Generalized Bin Covering
Matthias Hellwig, Alexander Souza
We consider the Generalized Bin Covering (GBC) problem: We are given bin types, where each bin of type has profit and demand . Furthermore, there are items,…
Buffer Overflow Management with Class Segregation
Kamal Al-Bawani, Alexander Souza
We consider a new model for buffer management of network switches with Quality of Service (QoS) requirements. A stream of packets, each attributed with a value representing its Cla…
Balanced Interval Coloring
Antonios Antoniadis, Falk Hüffner, Pascal Lenzner +2
We consider the discrepancy problem of coloring intervals with colors such that at each point on the line, the maximal difference between the number of intervals of any two…