default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdmund Ihler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j4]Tobias Jordine, Ying Liang, Edmund Ihler:
A Mobile Device Based Serious Gaming Approach for Teaching and Learning Java Programming. Int. J. Interact. Mob. Technol. 9(1): 53-59 (2015)- 2014
- [c6]Tobias Jordine, Ying Liang, Edmund Ihler:
A mobile-device based serious gaming approach for teaching and learning Java programming. FIE 2014: 1-5
2000 – 2009
- 2009
- [b2]Oliver Vogel, Ingo Arnold, Arif Chughtai, Edmund Ihler, Timo Kehrer, Uwe Mehlig, Uwe Zdun:
Software-Architektur - Grundlagen, Konzepte, Praxis (2. Aufl.). Spektrum Akademischer Verlag 2009, ISBN 978-3-8274-1933-0, pp. I-XX, 1-556 - 2000
- [c5]Ansgar Bredenfeld, Edmund Ihler, Oliver Vogel:
GENVIS - Model-Based Generation of Data Visualizers. TOOLS (33) 2000: 396-406
1990 – 1999
- 1999
- [j3]Edmund Ihler, Gabriele Reich, Peter Widmayer:
Class Steiner Trees and VLSI-design. Discret. Appl. Math. 90(1-3): 173-194 (1999) - 1996
- [i1]Edmund Ihler:
On polynomial time approximation schemes and approximation preserving reductions. Electron. Colloquium Comput. Complex. TR96 (1996) - 1994
- [j2]Edmund Ihler:
The rectilinear class Steiner tree problem for intervals on two parallel lines. Math. Program. 63: 281-296 (1994) - 1993
- [b1]Edmund Ihler:
Zur Übertragbarkeit von Approximationsalgorithmen für Optimierungsprobleme, insbesondere für das Problem CLASS TREE. University of Freiburg, Germany, 1993, pp. 1-150 - [j1]Edmund Ihler, Dorothea Wagner, Frank Wagner:
Modeling Hypergraphs by Graphs with the Same Mincut Properties. Inf. Process. Lett. 45(4): 171-175 (1993) - 1992
- [c4]Edmund Ihler:
Minimum Rectilinear Steiner Tree for Intervals on two Parallel Lines. WG 1992: 123-134 - 1991
- [c3]Edmund Ihler, Gabriele Reich, Peter Widmayer:
On Shortest Networks for Classes of Points in the Plane. Workshop on Computational Geometry 1991: 103-111 - [c2]Edmund Ihler:
The Complexity of Approximating the Class Steiner Tree Problem. WG 1991: 85-96 - 1990
- [c1]Edmund Ihler:
Bounds on the quality of approximate solutions to the Group Steiner Problem. WG 1990: 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-25 05:50 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:
