E-LIB Suche - Ergebnisse für: Strash, Darren

1

A dual-mode local search algorithm for solving the minimum ..:

Zhu, Enqiang ; Zhang, Yu ; Wang, Shengzhi..
Knowledge-Based Systems. 298 (2024) - p. 111950 , 2024

Link: https://doi.org/10.1016/..

2

Finding Near-Optimal Weight Independent Sets at Scale:

, In: Proceedings of the Genetic and Evolutionary Computation Conference,

Großmann, Ernestine ; Lamm, Sebastian ; Schulz, Christian. - p. 293-302 , 2023

Link: https://dl.acm.org/doi/1..

3

Efficient maximumk-plex computation over large sparse graph:

Chang, Lijun ; Xu, Mouyi ; Strash, Darren
Proceedings of the VLDB Endowment. 16 (2022) 2 - p. 127-139 , 2022

Link: https://doi.org/10.14778..

4

Recent Advances in Practical Data Reduction:

, In: Lecture Notes in Computer Science; Algorithms for Big Data,

Abu-Khzam, Faisal N. ; Lamm, Sebastian ; Mnich, Matthias... - p. 97-133 , 2022

Link: https://doi.org/10.1007/..

5

Communication-free massively distributed graph generation:

Funke, Daniel ; Lamm, Sebastian ; Meyer, Ulrich...
Journal of Parallel and Distributed Computing. 131 (2019) - p. 200-217 , 2019

Link: https://doi.org/10.1016/..

6

On Romeo and Juliet problems: Minimizing distance-to-sight:

Ahn, Hee-Kap ; Oh, Eunjin ; Schlipf, Lena..
Computational Geometry. 84 (2019) - p. 12-21 , 2019

Link: https://doi.org/10.1016/..

7

Convexity-increasing morphs of planar graphs:

Kleist, Linda ; Klemz, Boris ; Lubiw, Anna...
Computational Geometry. 84 (2019) - p. 69-88 , 2019

Link: https://doi.org/10.1016/..

8

Scalable Kernelization for Maximum Independent Sets:

Hespe, Demian ; Schulz, Christian ; Strash, Darren
Journal of Experimental Algorithmics (JEA). 24 (2019) 24 - p. 1-22 , 2019

Link: https://dl.acm.org/doi/1..

9

Scalable Kernelization for Maximum Independent Sets:

Hespe, Demian ; Schulz, Christian ; Strash, Darren
ACM Journal of Experimental Algorithmics. 24 (2019) - p. 1-22 , 2019

Link: https://doi.org/10.1145/..

10

Reconstructing Generalized Staircase Polygons with Uniform ..:

Sitchinava, Nodari ; Strash, Darren
Journal of Graph Algorithms and Applications. 22 (2018) 3 - p. 431-459 , 2018

Link: https://doi.org/10.7155/..

11

Practical Minimum Cut Algorithms:

Henzinger, Monika ; Noe, Alexander ; Schulz, Christian.
ACM Journal of Experimental Algorithmics. 23 (2018) - p. 1-22 , 2018

Link: https://doi.org/10.1145/..

12

Efficiently enumerating all maximal cliques with bit-parall..:

San Segundo, Pablo ; Artieda, Jorge ; Strash, Darren
Computers & Operations Research. 92 (2018) - p. 37-46 , 2018

Link: https://doi.org/10.1016/..

13

Practical Minimum Cut Algorithms:

Henzinger, Monika ; Noe, Alexander ; Schulz, Christian.
Journal of Experimental Algorithmics (JEA). 23 (2018) 23 - p. 1-22 , 2018

Link: https://dl.acm.org/doi/1..

14

Convexity-Increasing Morphs of Planar Graphs:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Kleist, Linda ; Klemz, Boris ; Lubiw, Anna... - p. 318-330 , 2018

Link: https://doi.org/10.1007/..

15

On the complexity of barrier resilience for fat regions and..:

Korman, Matias ; Löffler, Maarten ; Silveira, Rodrigo I..
Computational Geometry. 72 (2018) - p. 34-51 , 2018

Link: https://doi.org/10.1016/..