J. Mark Keil

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◁ ▶ single authored publications

> Home > Persons > J. Mark Keil

Publications

2000
[p1]
- view
  authority control:
- export record
  dblp key:
  - books/el/00/Keil00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/el/00/Keil00
J. Mark Keil:
Polygon Decomposition. Handbook of Computational Geometry 2000: 491-518
1997
[j19]
- view
  authority control:
- export record
  dblp key:
  - journals/ijcga/Keil97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcga/Keil97
J. Mark Keil:
Covering Orthogonal Polygons with Non-Piercing Rectangles. Int. J. Comput. Geom. Appl. 7(5): 473-484 (1997)
1994
[j16]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/comgeo/Keil94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/comgeo/Keil94
J. Mark Keil:
Computing a Subgraph of the Minimum Weight Triangulation. Comput. Geom. 4: 18-26 (1994)
1993
[j14]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/Keil93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Keil93
J. Mark Keil:
The Complexity of Domination Problems in Circle Graphs. Discret. Appl. Math. 42(1): 51-63 (1993)
1992
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/orl/Keil92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/Keil92
J. Mark Keil:
On the complexity of scheduling tasks with discrete starting times. Oper. Res. Lett. 12(5): 293-295 (1992)
1991
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/Keil91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Keil91
J. Mark Keil:
A Simple Algorithm for Determining the Envelope of a Set of Lines. Inf. Process. Lett. 39(3): 121-124 (1991)
1988
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/swat/Kei88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/swat/Kei88
J. Mark Keil:
Approximating the Complete Euclidean Graph. SWAT 1988: 208-213
1986
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/Keil86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Keil86
J. Mark Keil:
Total Domination in Interval Graphs. Inf. Process. Lett. 22(4): 171-174 (1986)
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/compgeom/Keil86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/Keil86
J. Mark Keil:
Minimally Covering a Horizontally Convex Orthogonal Polygon. SCG 1986: 43-51
1985
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/Keil85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Keil85
J. Mark Keil:
Finding Hamiltonian Circuits in Interval Graphs. Inf. Process. Lett. 20(4): 201-206 (1985)
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Keil85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Keil85
J. Mark Keil:
Decomposing a Polygon into Simpler Components. SIAM J. Comput. 14(4): 799-817 (1985)
1983
[b1]
- view
  - electronic edition @ utoronto.ca
  - no references & citations available
- export record
  dblp key:
  - phd/ca/Keil83
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/ca/Keil83
J. Mark Keil:
Decomposing polygons into simpler components. University of Toronto, Canada, 1983

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.