default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGregor Lagodzinski
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b1]Gregor Lagodzinski:
Counting homomorphisms over fields of prime order (Zählen von Homomorphismen über Körper mit Primzahlordnung). University of Potsdam, Germany, 2024- 2023
- [j6]Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander Löser, Marcus Wilhelm:
From symmetry to asymmetry: Generalizing TSP approximations by parametrization. J. Comput. Syst. Sci. 136: 157-170 (2023) - [c11]Kilian Becher, J. A. Gregor Lagodzinski, Javier Parra-Arnau, Thorsten Strufe:
Analysis and Prevention of Averaging Attacks Against Obfuscation Protocols. ACNS (1) 2023: 451-475 - 2022
- [j5]Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Andreas Göbel, J. A. Gregor Lagodzinski:
Zeros and approximations of Holant polynomials on the complex plane. Comput. Complex. 31(2): 11 (2022) - [c10]Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck
, Simon Wietheger:
Fixed-Parameter Sensitivity Oracles. ITCS 2022: 23:1-23:18 - 2021
- [j4]Andreas Göbel, J. A. Gregor Lagodzinski, Karen Seidel:
Counting Homomorphisms to Trees Modulo a Prime. ACM Trans. Comput. Theory 13(3): 19:1-19:33 (2021) - [c9]Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander Löser, Marcus Wilhelm:
From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization. FCT 2021: 53-66 - [c8]J. A. Gregor Lagodzinski, Andreas Göbel, Katrin Casel, Tobias Friedrich:
On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order. ICALP 2021: 91:1-91:15 - [i7]Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger:
Fixed-Parameter Sensitivity Oracles. CoRR abs/2112.03059 (2021) - 2020
- [j3]Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler, Anna Melnichenko:
Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming. Theor. Comput. Sci. 816: 96-113 (2020) - [j2]Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler:
The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time. Theor. Comput. Sci. 816: 144-168 (2020) - [j1]Tobias Friedrich, Timo Kötzing, J. A. Gregor Lagodzinski, Frank Neumann, Martin Schirneck:
Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints. Theor. Comput. Sci. 832: 3-19 (2020) - [c7]Tobias Friedrich, Martin S. Krejca, J. A. Gregor Lagodzinski, Manuel Rizzo, Arthur Zahn:
Memetic Genetic Algorithms for Time Series Compression by Piecewise Linear Approximation. ICONIP (3) 2020: 592-604 - [c6]Kilian Becher, J. A. Gregor Lagodzinski, Thorsten Strufe:
Privacy-Preserving Public Verification of Ethical Cobalt Sourcing. TrustCom 2020: 998-1005 - [i6]J. A. Gregor Lagodzinski, Andreas Göbel, Katrin Casel, Tobias Friedrich:
On Counting (Quantum-)Graph Homomorphisms in Finite Fields. CoRR abs/2011.04827 (2020)
2010 – 2019
- 2019
- [i5]Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Andreas Göbel, J. A. Gregor Lagodzinski:
Zeros and approximations of Holant polynomials on the complex plane. CoRR abs/1905.03194 (2019) - [i4]Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander Löser, Marcus Wilhelm:
From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization. CoRR abs/1911.02453 (2019) - 2018
- [c5]Andreas Göbel, J. A. Gregor Lagodzinski, Karen Seidel:
Counting Homomorphisms to Trees Modulo a Prime. MFCS 2018: 49:1-49:13 - [c4]Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler, Anna Melnichenko:
Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming. PPSN (2) 2018: 42-54 - [c3]Thomas Bläsius, Jan Eube, Thomas Feldtkeller, Tobias Friedrich, Martin S. Krejca, J. A. Gregor Lagodzinski, Ralf Rothenberger, Julius Severin, Fabian Sommer, Justin Trautmann:
Memory-Restricted Routing with Tiled Map Data. SMC 2018: 3347-3354 - [i3]Andreas Göbel, J. A. Gregor Lagodzinski, Karen Seidel:
Counting Homomorphisms to Trees Modulo a Prime. CoRR abs/1802.06103 (2018) - [i2]Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler, Anna Melnichenko:
Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming. CoRR abs/1805.10169 (2018) - [i1]Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler:
Bounding Bloat in Genetic Programming. CoRR abs/1806.02112 (2018) - 2017
- [c2]Tobias Friedrich, Timo Kötzing, Gregor Lagodzinski, Frank Neumann, Martin Schirneck:
Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints. FOGA 2017: 45-54 - [c1]Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler:
Bounding bloat in genetic programming. GECCO 2017: 921-928
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 2025-01-07 00:55 CET 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:
