Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

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

◀ ▶ joint publications with Michael Segal 0001

> Home > Persons > J. Mark Keil

Publications

2004
[j26]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/SpriggsKBSS04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/SpriggsKBSS04
Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink:
Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. Algorithmica 38(4): 577-589 (2004)
2003
[c10]
- view
  - electronic edition @ cccg.ca (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/cccg/SpriggsKBSS03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cccg/SpriggsKBSS03
Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink:
Approximating the geometric minimum-diameter spanning tree. CCCG 2003: 39-42
2002
[j22]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/BespamyatnikhBKKS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/BespamyatnikhBKKS02
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal:
Efficient algorithms for centers and medians in interval and circular-arc graphs. Networks 39(3): 144-152 (2002)
2000
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/esa/BespamyatnikhBKKS00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/BespamyatnikhBKKS00
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal:
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. ESA 2000: 100-111

a service of

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.