Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Matthias F. Stallmann"'
Autor:
Matthias F. Stallmann, Aissa Oudjit
Publikováno v:
Networks. 77:383-402
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cca84e6aaf15b293291a5ecc6354fc28
https://doi.org/10.1002/net.21978
https://doi.org/10.1002/net.21978
Publikováno v:
Theoretical Computer Science. 609:434-442
In some application cases, the solutions of combinatorial optimization problems on graphs should satisfy an additional vertex size constraint. In this paper, we consider size-constrained minimum s-t cut problems and size-constrained dense subgraph pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab3ca5d3ec4ce2bcd429075119a6802e
https://doi.org/10.1016/j.tcs.2015.10.031
https://doi.org/10.1016/j.tcs.2015.10.031
Autor:
Matthias F. Stallmann
Publikováno v:
IEEE computer graphics and applications. 37(1)
Although surveys suggest positive student attitudes toward the use of algorithm animations, it is not clear that they improve learning outcomes. The Graph Algorithm Animation Tool, or Galant, challenges and motivates students to engage more deeply wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1112cf28c554c695a504b02fccc3dc12
https://pubmed.ncbi.nlm.nih.gov/28103539
https://pubmed.ncbi.nlm.nih.gov/28103539
Autor:
Suzanne Balik, Michael Grace, Robert D. Rodman, Matthias F. Stallmann, Sina Bahram, Susan D. High
Publikováno v:
ITiCSE
ProofChecker is a graphical program based on the notion of formal correctness proofs that allows students, both sighted and visually impaired, to draw a deterministic finite automaton (DFA) and determine whether or not it correctly recognizes a given
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b9eb42a446b7893fe7ae60f888cc4b2
https://doi.org/10.1145/1269900.1268801
https://doi.org/10.1145/1269900.1268801
Publikováno v:
European Journal of Operational Research. 179:1097-1108
An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest supply point. p-Median is polynomially solvable in one dimension but NP-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae063dcc6d4994ef0bcfaa5cc8aeac19
https://doi.org/10.1016/j.ejor.2005.06.080
https://doi.org/10.1016/j.ejor.2005.06.080
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 43:1-34
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cfcb94f6d3446c96746d567c2094fe99
https://doi.org/10.1007/s10472-005-0417-5
https://doi.org/10.1007/s10472-005-0417-5
Autor:
Matthias F. Stallmann, Robert Hochberg
Publikováno v:
Information Processing Letters. 87:59-66
In the minimum linear arrangement problem one wishes to assign distinct integers to the vertices of a given graph so that the sum of the differences (in absolute value) across the edges of the graph is minimized. This problem is known to be NP-comple
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22338b89b3d615438398613f9409e566
https://doi.org/10.1016/s0020-0190(03)00261-8
https://doi.org/10.1016/s0020-0190(03)00261-8
Autor:
Matthias F. Stallmann, Xiao Yu Li
Publikováno v:
Information Processing Letters. 82:293-298
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well known that the barycenter heuristic can give solutions as bad as Ω( n ) times the optimum, where n is the number of nodes in the gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7128adfb8ba21db041d7917cda580455
https://doi.org/10.1016/s0020-0190(01)00297-6
https://doi.org/10.1016/s0020-0190(01)00297-6
Autor:
Veronica J. Sigler, Robert D. Rodman, Sean Mealin, Michelle L. Glatz, Suzanne Balik, Matthias F. Stallmann
Publikováno v:
ASSETS
Our goal in creating the Graph SKetching tool, GSK, was to provide blind screen reader users with a means to create and access graphs as node-link diagrams and share them with sighted people in real-time. Through this effort, we hoped to better inclu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b10c06713ce13b3f4b67d5b059fb7a3d
https://doi.org/10.1145/2661334.2661364
https://doi.org/10.1145/2661334.2661364
Publikováno v:
Networks. 36:47-52
When an activity-on-arc (AoA) project network is to be constructed, one typically seeks to minimize the number of dummy arcs. Recent investigations have shown, however, that the computational effort of many network-oriented project management techniq
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6efa816b13b9019a7b6dc404d832c09f
https://doi.org/10.1002/1097-0037(200008)36:1<47::aid-net5>3.0.co
https://doi.org/10.1002/1097-0037(200008)36:1<47::aid-net5>3.0.co