Forschungsbereich Algorithms and Complexity

Organization Name (de) Name der Organisation (de)
E192-01 - Forschungsbereich Algorithms and Complexity
 
Code Kennzahl
E192-01
 
Type of Organization Organisationstyp
Research Division
 
Parent OrgUnit Übergeordnete Organisation
Active Aktiv
 


Results 1-20 of 470 (Search time: 0.001 seconds).

PreviewAuthors / EditorsTitleTypeIssue Date
1Li, Guangping ; Nickel, Soeren ; Nöllenburg, Martin ; Viola, Ivan ; Wu, Hsiang-Yun World map of recipesPräsentation Presentation2019
2Bhore, Sujoy ; Ganian, Robert ; Li, Guangping ; Nöllenburg, Martin ; Wulms, Jules Worbel: Aggregating Point Labels intoWord CloudsKonferenzbeitrag Inproceedings 2021
3Ganian, Robert Well-Structured Modulators: FPT Algorithms and KernelsPräsentation Presentation2015
4Jatschka, Thomas ; Rodemann, Tobias ; Raidl, Günther VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service PointsKonferenzbeitrag Inproceedings 2019
5Jatschka, Thomas ; Rodemann, Tobias ; Raidl, Günther R. VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service PointsKonferenzbeitrag Inproceedings 2020
6Ordyniak, Sebastian Variable-Deletion Backdoors to PlanningPräsentation Presentation2015
7Grujicic, Igor ; Raidl, Günther ; Schöbel, Andreas ; Jarboui, Bassem ; Sifaleras, Angelo ; Rebai, Abdelwaheb Variable neighbourhood search for integrated timetable design of railway infrastructure.Konferenzbeitrag Inproceedings 2015
8Raidl, Günther Variable Neighborhood Search HybridsPräsentation Presentation2014
9Leitner, Markus ; Hu, Bin ; Raidl, Günther Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network ProblemKonferenzbeitrag Inproceedings 2007
10Gruber, Martin ; Raidl, Günther ; Hansen, P. Variable neighborhood search for the bounded diameter minimum spanning tree problem.Konferenzbeitrag Inproceedings 2005
11Leitner, Markus ; Raidl, Günther Variable neighborhood search for capacitated connected facility locationKonferenzbeitrag Inproceedings 2011
12Leitner, Markus ; Raidl, Günther Variable neighborhood search for a prize collecting capacity constrained connected facility location problemKonferenzbeitrag Inproceedings 2008
13Pirkwieser, Sandro ; Raidl, Günther Variable neighborhood search coupled with ILP-based large neighborhood searches for the (periodic) location-routing problemKonferenzbeitrag Inproceedings 2010
14Schauer, Christian ; Raidl, Günther Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network DesignKonferenzbeitrag Inproceedings 2012
15Ruthmair, Mario ; Raidl, Günther Variable neighborhood search and ant colony optimization for the rooted delay-constrained minimum spanning tree problemKonferenzbeitrag Inproceedings 2010
16Hu, Bin ; Raidl, Günther ; Cotta, Carlos ; Fernandez, A.J. ; Gallardo, J.E. Variable neighborhood descent with self-adaptive neighborhood-ordering.Konferenzbeitrag Inproceedings2006
17Leitner, Markus ; Raidl, Günther Variable neighborhood and greedy randomized adaptive search for capacitated connected facility locationKonferenzbeitrag Inproceedings 2011
18Inführ, Johannes ; Stezenbach, David ; Hartmann, Matthias ; Tutschku, Kurt ; Raidl, Günther Using optimized virtual network embedding for network dimensioningKonferenzbeitrag Inproceedings 2013
19Riedler, Martin ; Leitner, Markus ; Ljubic, Ivana ; Ruthmair, Mario Using Layered Graphs to solve the Directed Network Design Problem with RelaysPräsentation Presentation2017
20Eiben, Eduard ; Ganian, Robert ; Ordyniak, Sebastian Using Decomposition-Parameters for QBF: Mind the Prefix!Konferenzbeitrag Inproceedings 2016