default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnja Fischer
Person information
- affiliation: TU Dortmund, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Mirko Dahlbeck
, Anja Fischer, Frank Fischer, Philipp Hungerländer, Kerstin Maier:
Exact approaches for the combined cell layout problem. Eur. J. Oper. Res. 305(2): 530-546 (2023)- 2022
- [j14]Anja Fischer, Frank Fischer, S. Thomas McCormick:
Matroid optimization problems with monotone monomials in the objective. Discret. Appl. Math. 308: 20-35 (2022) - 2020
- [j13]Mirko Dahlbeck, Anja Fischer, Frank Fischer:
Decorous combinatorial lower bounds for row layout problems. Eur. J. Oper. Res. 286(3): 929-944 (2020) - [c11]Artur Jurk, Maik Boltze, Georg Keller, Lorna Ulbrich, Anja Fischer:
1A-Team / Martin-Luther-Universität Halle-Wittenberg@CLSciSumm 20. SDP@EMNLP 2020: 277-281
2010 – 2019
- 2019
- [j12]Anja Fischer, Frank Fischer:
Counting degree sequences of spanning trees in bipartite graphs: A graph-theoretic proof. J. Graph Theory 92(3): 230-236 (2019) - [j11]Anja Fischer, Frank Fischer, Philipp Hungerländer:
New exact approaches to row layout problems. Math. Program. Comput. 11(4): 703-754 (2019) - [c10]Seung-Jun Lee, Woojin Kim, Yang Koo Lee, Daesub Yoon, Junwook Lee, Giuliano Persico, Anja Fischer:
Design of the Operator Tracing Robot for Material Handling. ICTC 2019: 1254-1256 - 2018
- [j10]Miguel F. Anjos, Anja Fischer, Philipp Hungerländer:
Improved exact approaches for row layout problems with departments of equal length. Eur. J. Oper. Res. 270(2): 514-529 (2018) - [j9]Anja Fischer, Frank Fischer, S. Thomas McCormick:
Matroid optimisation problems with nested non-linear monomials in the objective function. Math. Program. 169(2): 417-446 (2018) - 2017
- [j8]Anja Fischer, Philipp Hungerländer:
The traveling salesman problem on grids with forbidden neighborhoods. J. Comb. Optim. 34(3): 891-915 (2017) - [c9]Michael Firstein, Anja Fischer, Philipp Hungerländer:
Closed Almost Knight's Tours on 2D and 3D Chessboards. OR 2017: 185-190 - [c8]Anja Fischer, Philipp Hungerländer, Anna Jellen:
The Traveling Salesperson Problem with Forbidden Neighborhoods on Regular 3D Grids. OR 2017: 213-219 - 2016
- [j7]Anja Fischer, J. Fabian Meier, Ulrich Pferschy, Rostislav Stanek:
Linear Models and Computational Experiments for the Quadratic TSP. Electron. Notes Discret. Math. 55: 97-100 (2016) - 2015
- [j6]Anja Fischer, Frank Fischer, Gerold Jäger, Jens Keilwagen, Paul Molitor, Ivo Grosse:
Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem. Comput. 3(2): 285-298 (2015) - [j5]Anja Fischer, Frank Fischer:
An extended approach for lifting clique tree inequalities. J. Comb. Optim. 30(3): 489-519 (2015) - [c7]Anja Fischer, Frank Fischer, Philipp Hungerländer:
A New Exact Approach to the Space-Free Double Row Layout Problem. OR 2015: 125-130 - 2014
- [j4]Anja Fischer, Frank Fischer, Gerold Jäger, Jens Keilwagen, Paul Molitor, Ivo Grosse:
Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics. Discret. Appl. Math. 166: 97-114 (2014) - [j3]Anja Fischer:
An Analysis of the Asymmetric Quadratic Traveling Salesman Polytope. SIAM J. Discret. Math. 28(1): 240-276 (2014) - [c6]Miguel F. Anjos, Anja Fischer, Philipp Hungerländer:
Solution Approaches for the Double-Row Equidistant Facility Layout Problem. OR 2014: 17-23 - [c5]Anja Fischer:
A Polyhedral Study of the Quadratic Traveling Salesman Problem. OR 2014: 143-149 - 2013
- [j2]Anja Fischer, Christoph Helmberg:
The symmetric quadratic traveling salesman problem. Math. Program. 142(1-2): 205-254 (2013) - [j1]Anja Fischer, Frank Fischer:
Complete description for the spanning tree problem with one linearised quadratic term. Oper. Res. Lett. 41(6): 701-705 (2013) - 2012
- [c4]Matthias Büchse, Anja Fischer:
Deciding the Twins Property for Weighted Tree Automata over Extremal Semifields. ATANLP@EACL 2012: 11-20 - [c3]Sören Lorenz, Matthias Hesse, Anja Fischer:
Simulation and optimization of robot driven production systems for peak-load reduction. WSC 2012: 254:1-254:12 - 2010
- [c2]Anja Fischer, Winfried E. Kühnhauser:
Efficient Algorithmic Safety Analysis of HRU Security Models. SECRYPT 2010: 49-58
2000 – 2009
- 2009
- [c1]Stephan Bode, Anja Fischer, Winfried E. Kühnhauser, Matthias Riebisch:
Software Architectural Design Meets Security Engineering. ECBS 2009: 109-118
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-04-24 22:45 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:
