default search action
Goos Kant
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
- [j13]Goos Kant, Michael Jacks, Corné Aantjes:
Coca-Cola Enterprises Optimizes Vehicle Routes for Efficient Product Delivery. Interfaces 38(1): 40-50 (2008) - 2002
- [j12]Alexander Poot, Goos Kant, Albert P. M. Wagelmans:
A savings based method for real-life vehicle routing problems. J. Oper. Res. Soc. 53(1): 57-68 (2002)
1990 – 1999
- 1998
- [j11]Therese Biedl, Goos Kant:
A better heuristic for orthogonal graph drawings. Comput. Geom. 9(3): 159-180 (1998) - 1997
- [j10]Therese Biedl, Goos Kant, Michael Kaufmann:
On Triangulating Planar Graphs Under the Four-Connectivity Constraint. Algorithmica 19(4): 427-446 (1997) - [j9]Goos Kant, Hans L. Bodlaender:
Triangulating Planar Graphs while Minimizing the Maximum Degree. Inf. Comput. 135(1): 1-14 (1997) - [j8]Goos Kant:
A More Compact Visibility Representation. Int. J. Comput. Geom. Appl. 7(3): 197-210 (1997) - [j7]Marek Chrobak, Goos Kant:
Convex Grid Drawings of 3-Connected Planar Graphs. Int. J. Comput. Geom. Appl. 7(3): 211-223 (1997) - [j6]Goos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis:
Area Requirement of Visibility Representations of Trees. Inf. Process. Lett. 62(2): 81-88 (1997) - [j5]Goos Kant, Xin He:
Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems. Theor. Comput. Sci. 172(1-2): 175-193 (1997) - 1996
- [j4]Goos Kant:
Drawing Planar Graphs Using the Canonical Ordering. Algorithmica 16(1): 4-32 (1996) - [j3]Goos Kant:
Augmenting Outerplanar Graphs. J. Algorithms 21(1): 1-25 (1996) - [c11]Ulrich Fößmeier, Goos Kant, Michael Kaufmann:
2-Visibility Drawings of Planar Graphs. GD 1996: 155-168 - 1994
- [c10]Therese Biedl, Goos Kant:
A Better Heuristic for Orthogonal Graph Drawings. ESA 1994: 24-35 - [c9]Therese Biedl, Goos Kant, Michael Kaufmann:
On Triangulating Planar Graphs under the Four-Connectivity Constraint. SWAT 1994: 83-94 - 1993
- [j2]Goos Kant:
A new method for planar graph drawings on a grid (abstract). SIGACT News 24(1): 60 (1993) - [c8]Goos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis:
Area Requirement of Visibility Representations of Trees. CCCG 1993: 192-197 - [c7]Goos Kant, Xin He:
Two Algorithms for Finding Rectangular Duals of Planar Graphs. WG 1993: 396-410 - [c6]Goos Kant:
A More Compact Visibility Representation. WG 1993: 411-424 - 1992
- [c5]Goos Kant:
Drawing Planar Graphs Using the lmc-Ordering (Extended Abstract). FOCS 1992: 101-110 - [c4]Goos Kant, Hans L. Bodlaender
:
Triangulating Planar Graphs While Minimizing the Maximum Degree. SWAT 1992: 258-271 - [c3]Goos Kant:
Hexagonal Grid Drawings. WG 1992: 263-276 - 1991
- [c2]Goos Kant, Hans L. Bodlaender
Planar Graph Augmentation Problems (Extended Abstract). WADS 1991: 286-298 - 1990
- [j1]Goos Kant, Jan van Leeuwen:
On special multiples of integers. Bull. EATCS 41: 210-211 (1990) - [c1]Goos Kant, Jan van Leeuwen:
The File Distribution Problem for Processor Networks. SWAT 1990: 48-59
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-07-03 20:39 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: