default search action
Maren Martens
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Pia Schwägerl, Anna Schidek, Holger Timinger, Maren Martens:
Modellierung von Process Mining im agilen Projektmanagement am Beispiel Scrum. AKWI Jahrestagung 2024: 181-185 - 2022
- [c12]Marlena Eisenschink, Christoph Glück, Miriam Maier, Elisabeth Scheuchenpflug, Holger Timinger
, Maren Martens:
A new trend in further education? Micro degrees as a contribution to deal with new paradigms in small and medium-sized enterprises. GeCon 2022: 1-6 - [c11]Maren Martens, Anna Schidek, Markus Schmidtner, Holger Timinger:
ADmed: An Adaptive Technical Process for the Agile Development of Medical Devices. KDIR 2022: 177-184 - [c10]Maren Martens, Verena Starflinger:
Alternative Prize Money Distributions for Higher Gender Equity in Sports. OR 2022: 333-339 - 2021
- [c9]Markus Schmidtner
A fractional 0-1 decision making approach for process variant management. ICE/ITMC 2021: 1-8
2010 – 2019
- 2019
- [c8]Maren Martens:
How to Improve Measuring Techniques for the Cumulative Elevation Gain upon Road Cycling. OR 2019: 643-649 - 2013
- [j5]Markus Chimani, Maria Kandyba, Maren Martens:
2-InterConnected Facility Location: Specification, Complexity, and Exact Solutions. Electron. Notes Discret. Math. 41: 21-28 (2013) - [j4]Ulrich Menne, Roland Wessäly, Maren Martens, Andreas Bley
Integrated optimization of aggregation and core for varying NGN architectures. Telecommun. Syst. 52(2): 1067-1079 (2013) - 2010
- [j3]Maren Martens, S. Thomas McCormick, Maurice Queyranne:
Separation, dimension, and facet algorithms for node flow polyhedra. Math. Program. 124(1-2): 317-348 (2010) - [c7]Maren Martens, Andreas Bley
Securely Connected Facility Location in Metric Graphs. OR 2010: 289-294
2000 – 2009
- 2009
- [j2]Maren Martens, Martin Skutella:
Flows with unit path capacities and related packing and covering problems. J. Comb. Optim. 18(3): 272-293 (2009) - [c6]Maren Martens:
A Simple Greedy Algorithm for the k-Disjoint Flow Problem. TAMC 2009: 291-300 - 2008
- [c5]Maren Martens, Martin Skutella:
Flows with Unit Path Capacities and Related Packing and Covering Problems. COCOA 2008: 180-189 - [c4]Maren Martens, S. Thomas McCormick:
A Polynomial Algorithm for Weighted Abstract Flow. IPCO 2008: 97-111 - 2007
- [c3]Maren Martens, Fernanda Salazar, Martin Skutella:
Convex Combinations of Single Source Unsplittable Flows. ESA 2007: 395-406 - 2006
- [j1]Maren Martens, Martin Skutella:
Flows on few paths: Algorithms and lower bounds. Networks 48(2): 68-76 (2006) - 2005
- [c2]Maren Martens, Martin Skutella:
Length-Bounded and Dynamic k-Splittable Flows. OR 2005: 297-302 - 2004
- [c1]Maren Martens, Martin Skutella:
Flows on Few Paths: Algorithms and Lower Bounds. ESA 2004: 520-531
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-15 21:39 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: