Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

551 Publications


2019 | Conference Paper | LibreCat-ID: 14539
A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–348.
LibreCat | DOI
 

2019 | Conference Paper | LibreCat-ID: 13942
Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location
C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, SciTePress, 2019, pp. 315–321.
LibreCat | DOI
 

2019 | Conference Paper | LibreCat-ID: 17432
Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient
S. Baswana, S. Gupta, A. Tulsyan, in: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019, pp. 65:1--65:16.
LibreCat | DOI
 

2019 | Dissertation | LibreCat-ID: 14851
On Scheduling with Setup Times
A. Mäcker, On Scheduling with Setup Times, Universität Paderborn, 2019.
LibreCat | Files available | DOI
 

2018 | Bachelorsthesis | LibreCat-ID: 5404
Online Algorithmen für das k-Page Migration Problem
P.I. Kolpaczki, Online Algorithmen Für Das K-Page Migration Problem, 2018.
LibreCat
 

2018 | Conference Paper | LibreCat-ID: 7570
Brief Announcement: Communication in Systems of Home Based Mobile Agents
F. Meyer auf der Heide, J.S. Schaefer, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018.
LibreCat | Files available | DOI
 

2018 | Mastersthesis | LibreCat-ID: 1186
Pure Nash Equilibria in Robust Congestion Games via Potential Functions
A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential Functions, Universität Paderborn, 2018.
LibreCat
 

2018 | Journal Article | LibreCat-ID: 1369
Pure Nash equilibria in restricted budget games
M. Drees, M. Feldotto, S. Riechers, A. Skopalik, Journal of Combinatorial Optimization (2018).
LibreCat | Files available | DOI
 

2018 | Book Chapter | LibreCat-ID: 16392
A Dynamic Distributed Data Structure for Top-k and k-Select Queries
B. Feldkord, M. Malatyali, F. Meyer auf der Heide, in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, Cham, 2018.
LibreCat | DOI
 

2018 | Conference Paper | LibreCat-ID: 2831
Disaggregating User Evaluations Using the Shapley Value
M. Feldotto, C.-J. Haake, A. Skopalik, N. Stroh-Maraun, in: Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6.
LibreCat | Files available | DOI
 

2018 | Journal Article | LibreCat-ID: 2848
Towards Flexible Demands in Online Leasing Problems.
S. Li, C. Markarian, F. Meyer auf der Heide, Algorithmica 80 (2018) 1556–1574.
LibreCat | Files available | DOI
 

2018 | Conference Paper | LibreCat-ID: 2850
Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets
H. Hamann, C. Markarian, F. Meyer auf der Heide, M. Wahby, in: Ninth International Conference on Fun with Algorithms (FUN), 2018.
LibreCat | Files available | DOI
 

2018 | Conference Paper | LibreCat-ID: 4375
A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension
M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier, in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.
LibreCat | Files available | DOI
 

2018 | Conference Paper | LibreCat-ID: 4565
Brief Announcement: Competitive Routing in Hybrid Communication Networks
D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018.
LibreCat | Files available | DOI
 

2018 | Bachelorsthesis | LibreCat-ID: 1187
Scenario-driven Strategy Analysis in a n-player Composition Game Model
M. Nachtigall, Scenario-Driven Strategy Analysis in a n-Player Composition Game Model, Universität Paderborn, 2018.
LibreCat
 

2018 | Journal Article | LibreCat-ID: 2849
Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks
F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, Theory of Computing Systems (2018).
LibreCat | Files available | DOI
 

2018 | Journal Article | LibreCat-ID: 3551
Scheduling with interjob communication on parallel processors
J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2018) 1356–1379.
LibreCat | Files available | DOI
 

2018 | Journal Article | LibreCat-ID: 669
Congestion games with mixed objectives
M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167.
LibreCat | Files available | DOI | arXiv
 

2018 | Bachelorsthesis | LibreCat-ID: 1188
Learning deterministic bandit behaviour form compositions
J. Kempf, Learning Deterministic Bandit Behaviour Form Compositions, Universität Paderborn, 2018.
LibreCat
 

2018 | Conference Paper | LibreCat-ID: 2484
Fully-Dynamic Bin Packing with Little Repacking
B. Feldkord, M. Feldotto, A. Gupta, G. Guruganesh, A. Kumar, S. Riechers, D. Wajc, in: I. Chatzigiannakis, C. Kaklamanis, D. Marx, D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, pp. 51:1-51:24.
LibreCat | Files available | DOI | arXiv
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed