default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarzena Fügenschuh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j5]Marzena Fügenschuh, Feng Fu
:
Overcoming vaccine hesitancy by multiplex social network targeting: an analysis of targeting algorithms and implications. Appl. Netw. Sci. 8(1): 67 (2023)- 2022
- [c7]Marzena Fügenschuh, Feng Fu:
Overcoming Vaccine Hesitancy by Multiplex Social Network Targeting. COMPLEX NETWORKS (1) 2022: 576-587 - 2020
- [j4]Marzena Fügenschuh, Ralucca Gera, Andrea Tagarelli:
ANGEL: A Synthetic Model for Airline Network Generation Emphasizing Layers. IEEE Trans. Netw. Sci. Eng. 7(3): 1977-1987 (2020) - [c6]Marzena Fügenschuh, Ralucca Gera, Andrea Tagarelli:
Topological Analysis of Synthetic Models for Air Transportation Multilayer Networks. COMPLEX NETWORKS (2) 2020: 206-217
2010 – 2019
- 2017
- [c5]Marzena Fügenschuh, Ralucca Gera, Tobias Lory:
A Synthetic Model for Multilevel Air Transportation Networks. OR 2017: 347-353 - 2015
- [c4]Marzena Fügenschuh, Armin Fügenschuh, Marina Ludszuweit, Aleksandar Mojsic, Joanna Sokól:
Mathematical Optimization of a Magnetic Ruler Layout with Rotated Pole Boundaries. OR 2015: 117-123 - 2012
- [j3]Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin:
LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison. Math. Program. Comput. 4(3): 275-306 (2012)
2000 – 2009
- 2008
- [j2]Armin Fügenschuh, Marzena Fügenschuh:
Integer linear programming models for topology optimization in sheet metal design. Math. Methods Oper. Res. 68(2): 313-331 (2008) - [j1]Michael Armbruster, Christoph Helmberg, Marzena Fügenschuh, Alexander Martin:
On the Graph Bisection Cut Polytope. SIAM J. Discret. Math. 22(3): 1073-1098 (2008) - [c3]Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin:
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem. IPCO 2008: 112-124 - 2006
- [c2]Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin:
Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem. EvoCOP 2006: 1-12 - 2005
- [c1]Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin:
LP-based Genetic Algorithm for the Minimum Graph Bisection Problem. OR 2005: 315-320
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-05-08 21:42 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:
