default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGünther R. Raidl
Person information
- affiliation: TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j54]Enrico Iurlano
, Tatjana Zec, Marko Djukanovic, Günther R. Raidl:
Signed double Roman domination on cubic graphs. Appl. Math. Comput. 471: 128612 (2024)- [j53]Johannes Varga, Günther R. Raidl, Elina Rönnberg, Tobias Rodemann:
Scheduling jobs using queries to interactively learn human availability times. Comput. Oper. Res. 167: 106648 (2024) - [c149]Jaume Reixach, Christian Blum, Marko Djukanovic, Günther R. Raidl:
A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem. EvoStar 2024: 1-15 - [c148]Maria Bresich, Günther R. Raidl, Steffen Limmer:
Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion. GECCO 2024 - 2023
- [j52]Nikolaus Frohner, Bernhard Neumann, Giulio Pace, Günther R. Raidl:
Approaching the Traveling Tournament Problem with Randomized Beam Search. Evol. Comput. 31(3): 233-257 (2023) - [c147]Thomas Jatschka, Tobias Rodemann, Günther R. Raidl:
A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning. EvoCOP 2023: 50-65 - [c146]Rupert Ettrich, Marc Huber, Günther R. Raidl:
A Policy-Based Learning Beam Search for Combinatorial Optimization. EvoCOP 2023: 130-145 - [c145]Steffen Limmer, Johannes Varga, Günther R. Raidl:
An Evolutionary Approach for Scheduling a Fleet of Shared Electric Vehicles. EvoApplications@EvoStar 2023: 3-18 - [c144]Nikolaus Frohner, Günther R. Raidl, Francisco Chicano:
Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlines. GECCO Companion 2023: 1941-1949 - [c143]Johannes Varga, Emil Karlsson, Günther R. Raidl, Elina Rönnberg, Fredrik Lindsten, Tobias Rodemann:
Speeding Up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks. LOD (1) 2023: 24-38 - [c142]Johannes Varga, Günther R. Raidl, Elina Rönnberg, Tobias Rodemann:
Interactive Job Scheduling with Partially Known Personnel Availabilities. OLA 2023: 236-247 - [i2]Enrico Iurlano, Tatjana Zec, Marko Djukanovic, Günther R. Raidl:
Signed double Roman domination on cubic graphs. CoRR abs/2308.01109 (2023) - 2022
- [j51]Johannes Varga, Günther R. Raidl, Steffen Limmer:
Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet. IEEE Access 10: 105786-105806 (2022) - [j50]Marko Djukanovic, Aleksandar Kartelj, Dragan Matic, Milana Grbic, Christian Blum, Günther R. Raidl:
Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences. Appl. Soft Comput. 122: 108844 (2022) - [c141]Fabio F. Oberweger, Günther R. Raidl, Elina Rönnberg, Marc Huber:
A Learning Large Neighborhood Search for the Staff Rerostering Problem. CPAIOR 2022: 300-317 - [c140]Marc Huber, Günther R. Raidl:
A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem. EUROCAST 2022: 87-95 - [c139]Thomas Jatschka, Matthias Rauscher, Bernhard Kreutzer, Yusuke Okamoto, Hiroaki Kataoka, Tobias Rodemann, Günther R. Raidl:
A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters. EUROCAST 2022: 121-129 - [c138]Jonas Mayerhofer, Markus Kirchweger, Marc Huber, Günther R. Raidl:
A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation. EvoCOP 2022: 127-142 - [c137]Nikolaus Frohner, Jan Gmys, Nouredine Melab, Günther R. Raidl, El-Ghazali Talbi:
Parallel Beam Search for Combinatorial Optimization. ICPP Workshops 2022: 21:1-21:8 - [c136]Nikolaus Frohner, Jan Gmys, Nouredine Melab, Günther R. Raidl, El-Ghazali Talbi:
Parallel Beam Search for Combinatorial Optimization (Extended Abstract). SOCS 2022: 273-275 - [d1]Maria Bresich, Günther R. Raidl, Johannes Varga:
HyMeHeu-solver - A Hybrid Metaheuristic Solver for the Directed Feedback Vertex Set Problem. Zenodo, 2022
- 2021
- [j49]Thomas Jatschka, Günther R. Raidl, Tobias Rodemann:
A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. Algorithms 14(8): 232 (2021) - [j48]Matthias Horn, Günther R. Raidl, Elina Rönnberg:
A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources. Ann. Oper. Res. 302(2): 477-505 (2021) - [j47]Johannes Maschler, Günther R. Raidl:
Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources. Ann. Oper. Res. 302(2): 507-531 (2021) - [j46]Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felip Manyà, Günther R. Raidl:
Solving longest common subsequence problems via a transformation to the maximum clique problem. Comput. Oper. Res. 125: 105089 (2021) - [j45]Matthias Horn, Johannes Maschler, Günther R. Raidl, Elina Rönnberg:
A∗-based construction of decision diagrams for a prize-collecting scheduling problem. Comput. Oper. Res. 126: 105125 (2021) - [j44]Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum:
An A⁎ search algorithm for the constrained longest common subsequence problem. Inf. Process. Lett. 166: 106041 (2021) - [c135]Matthias Horn, Günther R. Raidl:
A*-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem. CPAIOR 2021: 72-88 - [c134]Adrian Bracher, Nikolaus Frohner, Günther R. Raidl:
Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems. CPAIOR 2021: 283-298 - [c133]Marc Huber, Günther R. Raidl:
Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems. LOD 2021: 283-298 - 2020
- [j43]Benedikt Klocker, Herbert Fleischner, Günther R. Raidl:
A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three. Appl. Math. Comput. 380: 125233 (2020) - [j42]Marko Djukanovic, Günther R. Raidl, Christian Blum:
Finding Longest Common Subsequences: New anytime A∗ search results. Appl. Soft Comput. 95: 106499 (2020) - [j41]Marko Djukanovic, Günther R. Raidl, Christian Blum:
Anytime algorithms for the longest common palindromic subsequence problem. Comput. Oper. Res. 114 (2020) - [j40]Benedikt Klocker, Herbert Fleischner, Günther R. Raidl:
A model for finding transition-minors. Discret. Appl. Math. 283: 242-264 (2020) - [j39]Johannes Maschler, Günther R. Raidl:
Particle therapy patient scheduling with limited starting time variations of daily treatments. Int. Trans. Oper. Res. 27(1): 458-479 (2020) - [j38]Martin Riedler, Thomas Jatschka, Johannes Maschler, Günther R. Raidl:
An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem. Int. Trans. Oper. Res. 27(1): 573-613 (2020) - [c132]Nikolaus Frohner, Bernhard Neumann, Günther R. Raidl:
A Beam Search Approach to the Traveling Tournament Problem. EvoCOP 2020: 67-82 - [c131]Nikolaus Frohner, Matthias Horn, Günther R. Raidl:
Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines⁎. ISM 2020: 366-370 - [c130]Matthias Horn, Nikolaus Frohner, Günther R. Raidl:
Driver Shift Planning for an Online Store with Short Delivery Times. ISM 2020: 517-524 - [c129]Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum:
On Solving a Generalized Constrained Longest Common Subsequence Problem. OPTIMA 2020: 55-70 - [c128]Matthias Horn, Marko Djukanovic, Christian Blum, Günther R. Raidl:
On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. OPTIMA 2020: 134-149 - [c127]Thomas Jatschka, Fabio F. Oberweger, Tobias Rodemann, Günther R. Raidl:
Distributing Battery Swapping Stations for Electric Scooters in an Urban Area. OPTIMA 2020: 150-165 - [c126]Thomas Kaufmann, Matthias Horn, Günther R. Raidl:
A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem. PPSN (2) 2020: 385-398
2010 – 2019
- 2019
- [j37]Matthias Horn, Günther R. Raidl, Christian Blum:
Job sequencing with one common and multiple secondary resources: An A⁎/Beam Search based anytime algorithm. Artif. Intell. 277 (2019) - [c125]Christian Blum, Dhananjay R. Thiruvady, Andreas T. Ernst, Matthias Horn, Günther R. Raidl:
A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem. Australasian Conference on Artificial Intelligence 2019: 549-560 - [c124]Thomas Jatschka, Tobias Rodemann, Günther R. Raidl:
VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points. EUROCAST (1) 2019: 255-262 - [c123]Nikolaus Frohner, Stephan Teuschl, Günther R. Raidl:
Casual Employee Scheduling with Constraint Programming and Metaheuristics. EUROCAST (1) 2019: 279-287 - [c122]Matthias Horn, Günther R. Raidl:
Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem. EUROCAST (1) 2019: 344-351 - [c121]Marko Djukanovic, Günther R. Raidl, Christian Blum:
A Heuristic Approach for Solving the Longest Common Square Subsequence Problem. EUROCAST (1) 2019: 429-437 - [c120]Thomas Jatschka, Tobias Rodemann, Günther R. Raidl:
A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. EvoCOP 2019: 1-16 - [c119]Martin Riedler, Mario Ruthmair, Günther R. Raidl:
Strategies for Iteratively Refining Layered Graph Models. HM 2019: 46-62 - [c118]Nikolaus Frohner, Günther R. Raidl:
Towards Improving Merging Heuristics for Binary Decision Diagrams. LION 2019: 30-45 - [c117]Christian Kloimüllner, Günther R. Raidl:
A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems. LION 2019: 184-200 - [c116]Benedikt Klocker, Herbert Fleischner, Günther R. Raidl:
A SAT Approach for Finding Sup-Transition-Minors. LION 2019: 325-341 - [c115]Marko Djukanovic, Günther R. Raidl, Christian Blum:
A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation. LOD 2019: 154-167 - [c114]Nikolaus Frohner, Günther R. Raidl:
Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers. LOD 2019: 445-457 - [c113]Thomas Jatschka, Tobias Rodemann, Günther R. Raidl:
Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. LOD 2019: 738-750 - [p5]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
A Memetic Algorithm for Competitive Facility Location Problems. Business and Consumer Analytics: New Ideas 2019: 637-660 - 2018
- [j36]Martin Riedler, Günther R. Raidl:
Solving a selective dial-a-ride problem with logic-based Benders decomposition. Comput. Oper. Res. 96: 30-54 (2018) - [j35]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands. Transp. Sci. 52(3): 673-690 (2018) - [c112]Marko Djukanovic, Günther R. Raidl, Christian Blum:
Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem. LION 2018: 199-214 - 2017
- [j34]Christian Kloimüllner, Günther R. Raidl:
Full-load route planning for balancing bike sharing systems by logic-based benders decomposition. Networks 69(3): 270-289 (2017) - [j33]Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther R. Raidl:
Large neighborhood search for the most strings with few bad columns problem. Soft Comput. 21(17): 4901-4915 (2017) - [c111]Airam Expósito, Günther R. Raidl, Julio Brito, José A. Moreno-Pérez:
GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection. EUROCAST (1) 2017: 299-306 - [c110]Benedikt Klocker, Günther R. Raidl:
Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging. EUROCAST (1) 2017: 355-363 - [c109]Johannes Maschler, Martin Riedler, Günther R. Raidl:
Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments. EUROCAST (1) 2017: 364-372 - [c108]Bong-Min Kim, Christian Kloimüllner, Günther R. Raidl:
Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control. EvoCOP 2017: 91-107 - [c107]Christian Kloimüllner, Günther R. Raidl:
Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem. LION 2017: 150-165 - [c106]Matthias Horn, Günther R. Raidl, Christian Blum:
Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment. MOD 2017: 506-518 - [c105]Benedikt Klocker, Herbert Fleischner, Günther R. Raidl:
Finding Smooth Graphs with Small Independence Numbers. MOD 2017: 527-539 - [c104]Christopher Bacher, Günther R. Raidl:
Refining Partial Invalidations for Indexed Algebraic Dynamic Programming. MOD 2017: 562-573 - 2016
- [b1]Christian Blum, Günther R. Raidl:
Hybrid Metaheuristics - Powerful Tools for Optimization. Artificial Intelligence: Foundations, Theory, and Algorithms, Springer 2016, ISBN 978-3-319-30882-1, pp. 1-136 - [j32]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
Models and algorithms for competitive facility location problems with different customer behavior. Ann. Math. Artif. Intell. 76(1-2): 93-119 (2016) - [j31]Christian Schauer, Günther R. Raidl:
A Multi-Commodity Flow Based Model for Multi Layer Hierarchical Ring Network Design. Electron. Notes Discret. Math. 52: 189-196 (2016) - [j30]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands. Electron. Notes Discret. Math. 52: 245-252 (2016) - [j29]Hoong Chuin Lau, Günther R. Raidl, Pascal Van Hentenryck:
New developments in metaheuristics and their applications - Selected extended contributions from the 10th Metaheuristics International Conference (MIC 2013). J. Heuristics 22(4): 359-363 (2016) - [j28]Johannes Inführ, Günther R. Raidl:
A memetic algorithm for the virtual network mapping problem. J. Heuristics 22(4): 475-505 (2016) - [j27]Christian Blum, Günther R. Raidl:
Computational performance evaluation of two integer linear programming models for the minimum common string partition problem. Optim. Lett. 10(1): 189-205 (2016) - [c103]Benedikt Klocker, Herbert Fleischner, Günther R. Raidl:
Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers. HM 2016: 1-16 - [c102]Michael Prischink, Christian Kloimüllner, Benjamin Biesinger, Günther R. Raidl:
Districting and Routing for Security Control. HM 2016: 87-103 - 2015
- [j26]Gerhard Hiermann, Matthias Prandtstetter, Andrea Rendl, Jakob Puchinger, Günther R. Raidl:
Metaheuristics for solving a multimodal home-healthcare scheduling problem. Central Eur. J. Oper. Res. 23(1): 89-113 (2015) - [j25]Frederico Dusberger, Günther R. Raidl:
Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search. Electron. Notes Discret. Math. 47: 133-140 (2015) - [j24]Igor Grujicic, Günther R. Raidl, Andreas Schöbel:
Variable Neighborhood Search for Integrated Timetable Based Design of Railway Infrastructure. Electron. Notes Discret. Math. 47: 141-148 (2015) - [j23]Günther R. Raidl, Thomas Baumhauer, Bin Hu:
Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search. Electron. Notes Discret. Math. 47: 149-156 (2015) - [j22]Günther R. Raidl:
Decomposition based hybrid metaheuristics. Eur. J. Oper. Res. 244(1): 66-76 (2015) - [j21]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
A hybrid genetic algorithm with solution archive for the discrete (r|p)-centroid problem. J. Heuristics 21(3): 391-431 (2015) - [j20]Marian Rainer-Harbach, Petrina Papazek, Günther R. Raidl, Bin Hu, Christian Kloimüllner:
PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems. J. Glob. Optim. 63(3): 597-629 (2015) - [c101]Christian Schauer, Günther R. Raidl:
On the Comparison of Decoding Strategies for a Memetic Algorithm for the Multi Layer Hierarchical Ring Network Design Problem. EUROCAST 2015: 271-278 - [c100]Christoph Weiler, Benjamin Biesinger, Bin Hu, Günther R. Raidl:
Heuristic Approaches for the Probabilistic Traveling Salesman Problem. EUROCAST 2015: 342-349 - [c99]Frederico Dusberger, Günther R. Raidl:
A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Size. EUROCAST 2015: 384-392 - [c98]David Markvica, Christian Schauer, Günther R. Raidl:
CPU Versus GPU Parallelization of an Ant Colony Optimization for the Longest Common Subsequence Problem. EUROCAST 2015: 401-408 - [c97]Christopher Bacher, Günther R. Raidl, Thorsten Krenek:
A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles. EUROCAST 2015: 425-432 - [c96]Christian Kloimüllner, Petrina Papazek, Bin Hu, Günther R. Raidl:
A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems. EUROCAST 2015: 439-446 - [c95]Bin Hu, Andreas Windbichler, Günther R. Raidl:
A New Solution Representation for the Firefighter Problem. EvoCOP 2015: 25-35 - [c94]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands. EvoCOP 2015: 48-60 - [c93]Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther R. Raidl:
On solving the most strings with few bad columns problem: An ILP model and heuristics. INISTA 2015: 1-8 - [c92]Alan Tus, Andrea Rendl, Günther R. Raidl:
Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem. LION 2015: 186-201 - [c91]Frederico Dusberger, Günther R. Raidl:
A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem. OR 2015: 385-391 - [c90]Johannes Maschler, Günther R. Raidl:
A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem. OR 2015: 393-399 - [i1]Christian Blum, Günther R. Raidl:
Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problem. CoRR abs/1501.02388 (2015) - 2014
- [c89]Christian Kloimüllner, Petrina Papazek, Bin Hu, Günther R. Raidl:
Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case. EvoCOP 2014: 73-84 - [c88]Christopher Bacher, Thorsten Krenek, Günther R. Raidl:
Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles. EvoApplications 2014: 553-564 - [c87]Frederico Dusberger, Günther R. Raidl:
A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem. Hybrid Metaheuristics 2014: 85-99 - [c86]Günther R. Raidl, Thomas Baumhauer, Bin Hu:
Speeding Up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem. Hybrid Metaheuristics 2014: 183-197 - [c85]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior. LION 2014: 203-217 - [c84]Petrina Papazek, Christian Kloimüllner, Bin Hu, Günther R. Raidl:
Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid. PPSN 2014: 792-801 - [c83]Christian Schauer, Günther R. Raidl:
A Memetic Algorithm for Multi Layer Hierarchical Ring Network Design. PPSN 2014: 832-841 - 2013
- [j19]Markus Leitner, Mario Ruthmair, Günther R. Raidl:
Stabilizing branch-and-price for constrained tree problems. Networks 61(2): 150-170 (2013) - [c82]Petrica C. Pop, Bin Hu, Günther R. Raidl:
A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem. EUROCAST (1) 2013: 219-226 - [c81]Petrina Papazek, Günther R. Raidl, Marian Rainer-Harbach, Bin Hu:
A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems. EUROCAST (1) 2013: 372-379 - [c80]Benjamin Biesinger, Christian Schauer, Bin Hu, Günther R. Raidl:
Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents. EUROCAST (1) 2013: 380-387 - [c79]Marian Rainer-Harbach, Petrina Papazek, Bin Hu, Günther R. Raidl:
Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach. EvoCOP 2013: 121-132 - [c78]Johannes Inführ, Günther R. Raidl:
Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent. EvoCOP 2013: 250-261 - [c77]Günther R. Raidl, Bin Hu, Marian Rainer-Harbach, Petrina Papazek:
Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations. Hybrid Metaheuristics 2013: 130-143 - [c76]Johannes Inführ, Günther R. Raidl:
GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem. Hybrid Metaheuristics 2013: 159-173 - [c75]Johannes Inführ, David Stezenbach, Matthias Hartmann, Kurt Tutschku, Günther R. Raidl:
Using Optimized Virtual Network Embedding for Network Dimensioning. NetSys 2013: 118-125 - 2012
- [j18]Clemens Nothegger, Alfred Mayer, Andreas M. Chwatal, Günther R. Raidl:
Solving the post enrolment course timetabling problem by ant colony optimization. Ann. Oper. Res. 194(1): 325-339 (2012) - [c74]Andrea Rendl, Matthias Prandtstetter, Gerhard Hiermann, Jakob Puchinger, Günther R. Raidl:
Hybrid Heuristics for Multimodal Homecare Scheduling. CPAIOR 2012: 339-355 - [c73]Martin Schwengerer, Sandro Pirkwieser, Günther R. Raidl:
A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem. EvoCOP 2012: 13-24 - [c72]Thorsten Krenek, Mario Ruthmair, Günther R. Raidl, Michael Planer:
Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles. EvoApplications 2012: 376-385 - [c71]Bin Hu, Günther R. Raidl:
An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem. GECCO 2012: 393-400 - [c70]Mario Ruthmair, Günther R. Raidl:
On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem. ISCO 2012: 225-236 - [c69]Christian Schauer, Günther R. Raidl:
Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design. PPSN (1) 2012: 458-467 - 2011
- [j17]Andreas M. Chwatal, Günther R. Raidl:
Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques. Adv. Oper. Res. 2011: 143732:1-143732:38 (2011) - [j16]Christian Blum, Jakob Puchinger, Günther R. Raidl, Andrea Roli:
Hybrid metaheuristics in combinatorial optimization: A survey. Appl. Soft Comput. 11(6): 4135-4151 (2011) - [j15]Markus Leitner, Günther R. Raidl:
Branch-and-Cut-and-Price for Capacitated Connected Facility Location. J. Math. Model. Algorithms 10(3): 245-267 (2011) - [c68]Johannes Inführ, Günther R. Raidl:
Automatic Generation of 2-AntWars Players with Genetic Programming. EUROCAST (1) 2011: 248-255 - [c67]Martin Berlakovich, Mario Ruthmair, Günther R. Raidl:
A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. EUROCAST (1) 2011: 256-263 - [c66]Bin Hu, Günther R. Raidl:
An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem. EUROCAST (1) 2011: 287-294 - [c65]Markus Leitner, Günther R. Raidl:
Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location. EUROCAST (1) 2011: 295-302 - [c64]Mario Ruthmair, Günther R. Raidl:
A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem. EUROCAST (1) 2011: 351-358 - [c63]Sandro Pirkwieser, Günther R. Raidl, Jens Gottlieb:
Improved Packing and Routing of Vehicles with Compartments. EUROCAST (1) 2011: 392-399 - [c62]Andreas M. Chwatal, Corinna Thöni, Karin Oberlechner, Günther R. Raidl:
A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application. FedCSIS 2011: 239-246 - [c61]Johannes Inführ, Günther R. Raidl:
Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints. INOC 2011: 105-117 - [c60]Markus Leitner, Mario Ruthmair, Günther R. Raidl:
Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem. INOC 2011: 124-138 - [c59]Mario Ruthmair, Günther R. Raidl:
A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems. IPCO 2011: 376-388 - 2010
- [j14]Markus Leitner, Günther R. Raidl:
Strong Lower Bounds for a Survivable Network Design Problem. Electron. Notes Discret. Math. 36: 295-302 (2010) - [j13]Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy:
The Multidimensional Knapsack Problem: Structure and Algorithms. INFORMS J. Comput. 22(2): 250-265 (2010) - [j12]Bin Hu, Markus Leitner, Günther R. Raidl:
The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search. Networks 55(3): 256-275 (2010) - [c58]Martin Suntinger, Hannes Obweger, Josef Schiefer, Philip Limbeck, Günther R. Raidl:
Trend-Based Similarity Search in Time-Series Data. DBKDA 2010: 97-106 - [c57]Sandro Pirkwieser, Günther R. Raidl:
Multilevel Variable Neighborhood Search for Periodic Routing Problems. EvoCOP 2010: 226-238 - [c56]Günther R. Raidl, Bin Hu:
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive. EvoCOP 2010: 239-251 - [c55]Andreas M. Chwatal, Günther R. Raidl, Michael Zöch:
Fitting multi-planet transit models to photometric time-data series by evolution strategies. GECCO 2010: 377-384 - [c54]Andreas M. Chwatal, Günther R. Raidl:
Solving the Minimum Label Spanning Tree Problem by Ant Colony Optimization. GEM 2010: 91-97 - [c53]Christian Schauer, Matthias Prandtstetter, Günther R. Raidl:
A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents. Hybrid Metaheuristics 2010: 103-117 - [c52]Sandro Pirkwieser, Günther R. Raidl:
Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem. Hybrid Metaheuristics 2010: 174-189 - [c51]Anna Pagacz, Bin Hu, Günther R. Raidl:
A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problem. INCoS 2010: 356-361 - [c50]Mario Ruthmair, Günther R. Raidl:
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem. PPSN (2) 2010: 391-400 - [c49]Hannes Obweger, Martin Suntinger, Josef Schiefer, Günther R. Raidl:
Similarity Searching in Sequences of Complex Events. RCIS 2010: 631-640 - [p4]Jakob Puchinger, Günther R. Raidl, Sandro Pirkwieser:
MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics. Matheuristics 2010: 71-102 - [p3]Martin Gruber, Günther R. Raidl:
(Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. Matheuristics 2010: 209-229 - [e8]Maria J. Blesa, Christian Blum, Günther R. Raidl, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics - 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010. Proceedings. Lecture Notes in Computer Science 6373, Springer 2010, ISBN 978-3-642-16053-0 [contents]
2000 – 2009
- 2009
- [j11]Andreas M. Chwatal, Günther R. Raidl, Karin Oberlechner:
Solving a k-Node Minimum Label Spanning Arborescence Problem to Compress Fingerprint Templates. J. Math. Model. Algorithms 8(3): 293-334 (2009) - [c48]Andreas M. Chwatal, Günther R. Raidl:
Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms. EUROCAST 2009: 649-656 - [c47]Martin Gruber, Günther R. Raidl:
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics. EUROCAST 2009: 665-672 - [c46]Mario Ruthmair, Günther R. Raidl:
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. EUROCAST 2009: 713-720 - [c45]Matthias Prandtstetter, Günther R. Raidl, Thomas Misar:
A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse. EvoCOP 2009: 25-36 - [c44]Martin Gruber, Günther R. Raidl:
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances. GECCO 2009: 263-270 - [c43]Matthias Prandtstetter, Günther R. Raidl:
Meta-heuristics for reconstructing cross cut shredded text documents. GECCO 2009: 349-356 - [c42]Bin Hu, Günther R. Raidl:
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem. HIS (3) 2009: 63-68 - [c41]Sandro Pirkwieser, Günther R. Raidl:
Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows. Hybrid Metaheuristics 2009: 45-59 - [c40]Jakob Walla, Mario Ruthmair, Günther R. Raidl:
Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search. Hybrid Metaheuristics 2009: 84-99 - 2008
- [j10]Matthias Prandtstetter, Günther R. Raidl:
An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem. Eur. J. Oper. Res. 191(3): 1004-1022 (2008) - [j9]Jakob Puchinger, Günther R. Raidl:
Bringing order into the neighborhoods: relaxation guided variable neighborhood search. J. Heuristics 14(5): 457-472 (2008) - [j8]Bin Hu, Markus Leitner, Günther R. Raidl:
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. J. Heuristics 14(5): 473-499 (2008) - [c39]Bin Hu, Günther R. Raidl:
Effective Neighborhood Structures for the Generalized Traveling Salesman Problem. EvoCOP 2008: 36-47 - [c38]Sandro Pirkwieser, Günther R. Raidl:
Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms. GECCO 2008: 323-330 - [c37]Bin Hu, Günther R. Raidl:
Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem. HIS 2008: 73-77 - [c36]Markus Leitner, Günther R. Raidl:
Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks. Hybrid Metaheuristics 2008: 158-174 - [c35]Matthias Prandtstetter, Günther R. Raidl:
Combining Forces to Reconstruct Strip Shredded Text Documents. Hybrid Metaheuristics 2008: 175-189 - [c34]Markus Leitner, Günther R. Raidl:
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem. SAINT 2008: 233-236 - [c33]Martin Gruber, Günther R. Raidl:
Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. SAINT 2008: 261-264 - [p2]Günther R. Raidl, Jakob Puchinger:
Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization. Hybrid Metaheuristics 2008: 31-62 - [p1]Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger:
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 69-85 - 2007
- [j7]Jakob Puchinger, Günther R. Raidl:
Models and algorithms for three-stage two-dimensional bin packing. Eur. J. Oper. Res. 183(3): 1304-1327 (2007) - [c32]Andreas M. Chwatal, Günther R. Raidl:
Determining Orbital Elements of Extrasolar Planets by Evolution Strategies. EUROCAST 2007: 870-877 - [c31]Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger:
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem. EvoCOP 2007: 176-187 - 2006
- [j6]Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom:
Biased Mutation Operators for Subgraph-Selection Problems. IEEE Trans. Evol. Comput. 10(2): 145-156 (2006) - [c30]Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy:
The Core Concept for the Multidimensional Knapsack Problem. EvoCOP 2006: 195-208 - [c29]Martin Gruber, Jano I. van Hemert, Günther R. Raidl:
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. GECCO 2006: 1187-1194 - [c28]Günther R. Raidl:
A Unified View on Hybrid Metaheuristics. Hybrid Metaheuristics 2006: 1-12 - [c27]Daniel Wagner, Günther R. Raidl, Ulrich Pferschy, Petra Mutzel, Peter Bachhiesl:
A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. OR 2006: 197-202 - [e7]Jens Gottlieb, Günther R. Raidl:
Evolutionary Computation in Combinatorial Optimization, 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings. Lecture Notes in Computer Science 3906, Springer 2006, ISBN 3-540-33178-6 [contents] - 2005
- [j5]Günther R. Raidl, Jens Gottlieb:
Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem. Evol. Comput. 13(4): 441-475 (2005) - [c26]Jakob Puchinger, Günther R. Raidl:
Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification. IWINAC (2) 2005: 41-53 - [e6]Günther R. Raidl, Jens Gottlieb:
Evolutionary Computation in Combinatorial Optimization, 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings. Lecture Notes in Computer Science 3448, Springer 2005, ISBN 3-540-25337-8 [contents] - 2004
- [j4]Jens Gottlieb, Emma Hart, Martin Middendorf, Günther R. Raidl, Colin Reeves:
Editorial. J. Math. Model. Algorithms 3(4): 311-312 (2004) - [c25]Jakob Puchinger, Günther R. Raidl, Gabriele Koller:
Solving a Real-World Glass Cutting Problem. EvoCOP 2004: 165-176 - [c24]Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, René Weiskircher:
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. GECCO (1) 2004: 1304-1315 - [c23]Gabriele Koller, Günther R. Raidl:
An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem. PPSN 2004: 302-311 - [c22]Jakob Puchinger, Günther R. Raidl:
An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing. PPSN 2004: 642-651 - [c21]Harald Feltl, Günther R. Raidl:
An improved hybrid genetic algorithm for the generalized assignment problem. SAC 2004: 990-995 - [e5]Jens Gottlieb, Günther R. Raidl:
Evolutionary Computation in Combinatorial Optimization, 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004, Proceedings. Lecture Notes in Computer Science 3004, Springer 2004, ISBN 3-540-21367-8 [contents] - [e4]Günther R. Raidl, Stefano Cagnoni, Jürgen Branke, David Corne, Rolf Drechsler, Yaochu Jin, Colin G. Johnson, Penousal Machado, Elena Marchiori, Franz Rothlauf, George D. Smith, Giovanni Squillero:
Applications of Evolutionary Computing, EvoWorkshops 2004: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoMUSART, and EvoSTOC, Coimbra, Portugal, April 5-7, 2004, Proceedings. Lecture Notes in Computer Science 3005, Springer 2004, ISBN 3-540-21378-3 [contents] - 2003
- [j3]Ivana Ljubic, Günther R. Raidl:
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs. J. Heuristics 9(5): 401-427 (2003) - [j2]Günther R. Raidl, Bryant A. Julstrom:
Edge sets: an effective evolutionary coding of spanning trees. IEEE Trans. Evol. Comput. 7(3): 225-239 (2003) - [c20]Günther R. Raidl, Bryant A. Julstrom:
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. SAC 2003: 747-752 - [e3]Günther R. Raidl, Jean-Arcady Meyer, Martin Middendorf, Stefano Cagnoni, Juan J. Romero Cardalda, David Corne, Jens Gottlieb, Agnès Guillot, Emma Hart, Colin G. Johnson, Elena Marchiori:
Applications of Evolutionary Computing, EvoWorkshop 2003: EvoBIO, EvoCOP, EvoIASP, EvoMUSART, EvoROB, and EvoSTIM, Essex, UK, April 14-16, 2003, Proceedings. Lecture Notes in Computer Science 2611, Springer 2003, ISBN 3-540-00976-0 [contents] - 2002
- [j1]Günther R. Raidl, Ivana Ljubic:
Evolutionary local search for the edge-biconnectivity augmentation problem. Inf. Process. Lett. 82(1): 39-45 (2002) - [c19]Michael Schreyer, Günther R. Raidl:
Letting ants labeling point features [sic.: for 'labeling' read 'label']. IEEE Congress on Evolutionary Computation 2002: 1564-1569 - [c18]Sandor Kersting, Günther R. Raidl, Ivana Ljubic:
A Memetic Algorithm for Vertex-Biconnectivity Augmentation. EvoWorkshops 2002: 102-111 - [c17]Günther R. Raidl, Gabriele Kodydek, Bryant A. Julstrom:
On Weight-Biased Mutation for Graph Problems. PPSN 2002: 204-213 - [c16]Roger L. Wainwright, Günther R. Raidl:
Evolutionary computation and optimization track: SAC 2002. SAC 2002: 541 - [c15]Bryant A. Julstrom, Günther R. Raidl:
Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges. SAC 2002: 547-552 - [e2]Stefano Cagnoni, Jens Gottlieb, Emma Hart, Martin Middendorf, Günther R. Raidl:
Applications of Evolutionary Computing, EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN, Kinsale, Ireland, April 3-4, 2002, Proceedings. Lecture Notes in Computer Science 2279, Springer 2002, ISBN 3-540-43432-1 [contents] - 2001
- [c14]Ivana Ljubic, Günther R. Raidl:
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem. EvoWorkshops 2001: 20-29 - [c13]Roger L. Wainwright, Günther R. Raidl:
Evolutionary computation and optimization track. SAC 2001: 315 - [c12]Bryant A. Julstrom, Günther R. Raidl:
Weight-biased edge-crossover in evolutionary algorithms for wto graph problems. SAC 2001: 321-326 - [e1]Egbert J. W. Boers, Jens Gottlieb, Pier Luca Lanzi, Robert E. Smith, Stefano Cagnoni, Emma Hart, Günther R. Raidl, H. Tijink:
Applications of Evolutionary Computing, EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Como, Italy, April 18-20, 2001, Proceedings. Lecture Notes in Computer Science 2037, Springer 2001, ISBN 3-540-41920-9 [contents] - 2000
- [c11]Günther R. Raidl:
An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem. CEC 2000: 104-111 - [c10]Jens Gottlieb, Günther R. Raidl:
The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search. GECCO 2000: 283-290 - [c9]Ivana Ljubic, Günther R. Raidl, Jozef Kratica:
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem. PPSN 2000: 641-650 - [c8]Günther R. Raidl, Bryant A. Julstrom:
A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. SAC (1) 2000: 440-445
1990 – 1999
- 1999
- [c7]Jens Gottlieb, Günther R. Raidl:
Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem. Artificial Evolution 1999: 38-52 - [c6]Günther R. Raidl:
Weight-codings in a genetic algorithm for the multi-constraint knapsack problem. CEC 1999: 596-603 - [c5]Günther R. Raidl:
A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem. SAC 1999: 291-296 - 1998
- [c4]Ingeborg Tastl, Günther R. Raidl:
Transforming an analytically defined color space to match psychophysically gained color distances. Color Imaging: Device-Independent Color, Color Hardcopy, and Graphic Arts 1998: 98-106 - [c3]Günther R. Raidl, Gabriele Kodydek:
Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks. NC 1998: 885-890 - [c2]Günther R. Raidl, Gabriele Kodydek:
Genetic Algorithms for the Multiple Container Packing Problem. PPSN 1998: 875-884 - 1996
- [c1]Günther R. Raidl:
Skillful Genotype Decoding in EAs for Solving the Cutting Problem. Evolutionary Programming 1996: 113-120
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
