J. Mark Keil

Available identifiers

zbMath Open keil.j-markWikidataQ102268244 ScholiaQ102268244MaRDI QIDQ680147

List of research outcomes

Publication	Date of Publication	Type
Minimum ply covering of points with unit squares	2023-11-24	Paper
Improved and generalized algorithms for burning a planar point set	2023-11-24	Paper
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set	2023-07-21	Paper
Bottleneck convex subsets: finding \(k\) large convex sets in a point set	2023-03-30	Paper
Finding a Maximum Clique in a Grounded 1-Bend String Graph	2023-03-30	Paper
Computing maximum independent set on outerstring graphs and their relatives	2022-04-08	Paper
https://portal.mardi4nfdi.de/entity/Q5116476	2020-08-25	Paper
Polygon simplification by minimizing convex corners	2019-09-10	Paper
Swapping colored tokens on graphs	2018-05-17	Paper
An algorithm for the maximum weight independent set problem on outerstring graphs	2018-01-22	Paper
Polygon simplification by minimizing convex corners	2016-09-02	Paper
Computing a minimum outer-connected dominating set for the class of chordal graphs	2014-04-11	Paper
Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs	2012-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q3000094	2011-05-18	Paper
The relative neighbourhood graph is a part of every \(30^\circ \)-triangulation	2010-06-09	Paper
The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions	2010-04-27	Paper
Algorithmic properties of ciliate sequence alignment	2010-02-19	Paper
Routing Properties of the Localized Delaunay Triangulation over Heterogeneous Ad-Hoc Wireless Networks	2009-01-27	Paper
POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM	2007-05-23	Paper
Algorithms for optimal area triangulations of a convex polygon	2006-10-25	Paper
Approximating the minimum clique cover and other hard problems in subtree filament graphs	2006-09-28	Paper
Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree	2004-09-22	Paper
Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs	2004-08-06	Paper
A new bound for map labeling with uniform circle pairs	2003-06-24	Paper
https://portal.mardi4nfdi.de/entity/Q4259288	2003-06-05	Paper
https://portal.mardi4nfdi.de/entity/Q2753927	2001-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q4945512	2000-08-29	Paper
A large subgraph of the minimum weight triangulation	1998-07-27	Paper
Computing Visibility Information in an Inaccurate Simple Polygon	1998-02-08	Paper
Covering Orthogonal Polygons with Non-Piercing Rectangles	1997-10-30	Paper
Computing a subgraph of the minimum weight triangulation	1995-03-01	Paper
The complexity of domination problems in circle graphs	1993-05-16	Paper
https://portal.mardi4nfdi.de/entity/Q4028874	1993-03-28	Paper
Efficient Algorithms for the Capacitated 1-Median Problem	1993-02-25	Paper
On the complexity of scheduling tasks with discrete starting times	1993-01-04	Paper
Classes of graphs which approximate the complete Euclidean graph	1992-06-28	Paper
An optimal algorithm for finding dominating cycles in circular-arc graphs	1992-06-28	Paper
https://portal.mardi4nfdi.de/entity/Q3983251	1992-06-27	Paper
https://portal.mardi4nfdi.de/entity/Q3802644	1988-01-01	Paper
A Dynamic Programming Approach to the Dominating Set Problem on k-Trees	1987-01-01	Paper
Total domination in interval graphs	1986-01-01	Paper
Finding minimum dominating cycles in permutation graphs	1985-01-01	Paper
Finding Hamiltonian circuits in interval graphs	1985-01-01	Paper
Decomposing a Polygon into Simpler Components	1985-01-01	Paper
Domination in permutation graphs	1985-01-01	Paper
A note on a conjecture by Gavril on clique separable graphs	1983-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: J. Mark Keil