![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Alexander Noe
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c10]Monika Henzinger, Alexander Noe, Christian Schulz:
Practical Fully Dynamic Minimum Cut Algorithms. ALENEX 2022: 13-26 - [c9]Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen:
A Local Search Algorithm for Large Maximum Weight Independent Set Problems. ESA 2022: 45:1-45:16 - [p1]Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash:
Recent Advances in Practical Data Reduction. Algorithms for Big Data 2022: 97-133 - [i14]Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen:
A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems. CoRR abs/2203.15805 (2022) - 2021
- [j3]Yuanyuan Dong
, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende
, Quico Spaen:
New Instances for Maximum Weight Independent Set From a Vehicle Routing Application. Oper. Res. Forum 2(4) (2021) - [c8]Monika Henzinger
, Alexander Noe, Christian Schulz:
Faster Parallel Multiterminal Cuts. ACDA 2021: 100-110 - [i13]Monika Henzinger, Alexander Noe, Christian Schulz:
Practical Fully Dynamic Minimum Cut Algorithms. CoRR abs/2101.05033 (2021) - [i12]Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen:
New instances for maximum weight independent set from a vehicle routing application. CoRR abs/2105.12623 (2021) - [i11]Monika Henzinger, Alexander Noe:
Random Rank-Based, Hierarchical or Trivial: Which Dynamic Graph Algorithm Performs Best in Practice? CoRR abs/2108.04564 (2021) - [i10]Alexander Noe:
Algorithm Engineering for Cut Problems. CoRR abs/2108.04566 (2021) - 2020
- [j2]Alexandra Henzinger, Alexander Noe
, Christian Schulz
:
ILP-Based Local Search for Graph Partitioning. ACM J. Exp. Algorithmics 25: 1-26 (2020) - [c7]Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-Memory Branch-and-Reduce for Multiterminal Cuts. ALENEX 2020: 42-55 - [c6]Monika Henzinger
, Alexander Noe
, Christian Schulz
, Darren Strash
:
Finding All Global Minimum Cuts in Practice. ESA 2020: 59:1-59:20 - [i9]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Finding All Global Minimum Cuts In Practice. CoRR abs/2002.06948 (2020) - [i8]Monika Henzinger, Alexander Noe, Christian Schulz:
Faster Parallel Multiterminal Cuts. CoRR abs/2004.11666 (2020) - [i7]Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash:
Recent Advances in Practical Data Reduction. CoRR abs/2012.12594 (2020)
2010 – 2019
- 2019
- [c5]Monika Henzinger
, Alexander Noe, Christian Schulz
:
Shared-Memory Exact Minimum Cuts. IPDPS 2019: 13-22 - [i6]Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-Memory Branch-and-Reduce for Multiterminal Cuts. CoRR abs/1908.04141 (2019) - 2018
- [j1]Monika Henzinger
, Alexander Noe
, Christian Schulz
, Darren Strash
:
Practical Minimum Cut Algorithms. ACM J. Exp. Algorithmics 23 (2018) - [c4]Monika Henzinger, Alexander Noe, Christian Schulz
, Darren Strash
:
Practical Minimum Cut Algorithms. ALENEX 2018: 48-61 - [c3]Alexandra Henzinger, Alexander Noe, Christian Schulz
:
ILP-based Local Search for Graph Partitioning. SEA 2018: 4:1-4:15 - [i5]Alexandra Henzinger, Alexander Noe, Christian Schulz:
ILP-based Local Search for Graph Partitioning. CoRR abs/1802.07144 (2018) - [i4]Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-memory Exact Minimum Cuts. CoRR abs/1808.05458 (2018) - 2017
- [i3]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Practical Minimum Cut Algorithms. CoRR abs/1708.06127 (2017) - 2016
- [c2]Timo Bingmann, Michael Axtmann, Emanuel Jöbstl, Sebastian Lamm, Huyen Chau Nguyen, Alexander Noe, Sebastian Schlag, Matthias Stumpp, Tobias Sturm, Peter Sanders:
Thrill: High-performance algorithmic distributed batch data processing with C++. IEEE BigData 2016: 172-183 - [i2]Timo Bingmann, Michael Axtmann, Emanuel Jöbstl, Sebastian Lamm, Huyen Chau Nguyen, Alexander Noe, Sebastian Schlag, Matthias Stumpp, Tobias Sturm, Peter Sanders:
Thrill: High-Performance Algorithmic Distributed Batch Data Processing with C++. CoRR abs/1608.05634 (2016) - 2015
- [c1]Roland Glantz, Henning Meyerhenke
, Alexander Noe:
Algorithms for Mapping Parallel Processes onto Grid and Torus Architectures. PDP 2015: 236-243 - 2014
- [i1]Roland Glantz, Henning Meyerhenke, Alexander Noe:
Algorithms for Mapping Parallel Processes onto Grid and Torus Architectures. CoRR abs/1411.0921 (2014)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint