Остановите войну!
for scientists:
default search action
Manuel Sorge
- > Home > Persons > Manuel Sorge
Publications
- 2020
- [j22]René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
h-Index manipulation by undoing merges. Quant. Sci. Stud. 1(4): 1529-1552 (2020) - 2018
- [j14]René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Discret. Optim. 30: 20-50 (2018) - 2017
- [j11]René van Bevern, Christian Komusiewicz, Manuel Sorge:
A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments. Networks 70(3): 262-278 (2017) - 2016
- [j9]René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
H-index manipulation by merging articles: Models, theory, and experiments. Artif. Intell. 240: 19-35 (2016) - [j8]Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge:
Exploiting hidden structure in selecting dimensions that distinguish vectors. J. Comput. Syst. Sci. 82(3): 521-535 (2016) - [c19]René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
h-Index Manipulation by Undoing Merges. ECAI 2016: 895-903 - [c18]René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Twins in Subdivision Drawings of Hypergraphs. GD 2016: 67-80 - [c17]René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Finding Secluded Places of Special Interest in Graphs. IPEC 2016: 5:1-5:16 - [i16]René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
h-Index Manipulation by Undoing Merges. CoRR abs/1604.04827 (2016) - [i13]René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Finding Secluded Places of Special Interest in Graphs. CoRR abs/1606.09000 (2016) - 2015
- [j6]René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý:
On the Parameterized Complexity of Computing Balanced Partitions in Graphs. Theory Comput. Syst. 57(1): 1-35 (2015) - [c15]René van Bevern, Christian Komusiewicz, Manuel Sorge:
Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems. ATMOS 2015: 130-143 - [c13]René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. IJCAI 2015: 808-814 - [i12]René van Bevern, Christian Komusiewicz, Manuel Sorge:
Approximation algorithms for mixed, windy, and capacitated arc routing problems. CoRR abs/1506.05620 (2015) - [i11]René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Well-Formed Separator Sequences, with an Application to Hypergraph Drawing. CoRR abs/1507.02350 (2015) - [i10]René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Twins in Subdivision Drawings of Hypergraphs. CoRR abs/1511.09389 (2015) - [i9]Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge:
Exploiting Hidden Structure in Selecting Dimensions that Distinguish Vectors. CoRR abs/1512.01150 (2015) - 2014
- [j3]René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge:
Constant-factor approximations for Capacitated Arc Routing without triangle inequality. Oper. Res. Lett. 42(4): 290-292 (2014) - [i8]René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge:
Constant-factor approximations for Capacitated Arc Routing without triangle inequality. CoRR abs/1404.3660 (2014) - [i5]René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
On Google Scholar H-Index Manipulation by Merging Articles. CoRR abs/1412.5498 (2014) - 2013
- [c7]Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge:
A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. MFCS 2013: 445-456 - [c6]René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý:
On the Parameterized Complexity of Computing Graph Bisections. WG 2013: 76-87 - [i3]René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý:
On the Parameterized Complexity of Computing Balanced Partitions in Graphs. CoRR abs/1312.7014 (2013) - 2012
- [j1]Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller:
A new view on Rural Postman based on Eulerian Extension and Matching. J. Discrete Algorithms 16: 12-33 (2012) - 2011
- [c3]Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller:
A New View on Rural Postman Based on Eulerian Extension and Matching. IWOCA 2011: 310-323 - [c2]Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller:
From Few Components to an Eulerian Graph by Adding Arcs. WG 2011: 307-318
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-04-25 02:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint