default search action

combined dblp search
author search
venue search
publication search

ask others

Terrance A. Mankus

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Journal Articles

see FAQ

What is the meaning of the colors in the publication lists?

2002
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/ManacherM02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/ManacherM02
Glenn K. Manacher, Terrance A. Mankus:
A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone. Networks 39(2): 68-72 (2002)
1997
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/ijfcs/ManacherM97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/ManacherM97
Glenn K. Manacher, Terrance A. Mankus:
Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications. Int. J. Found. Comput. Sci. 8(4): 469- (1997)
1996
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/siamdm/ManacherM96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/ManacherM96
Glenn K. Manacher, Terrance A. Mankus:
Finding a Domatic Partition of an Interval Graph in Time O(n). SIAM J. Discret. Math. 9(2): 167-172 (1996)
1992
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/ManacherM92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/ManacherM92
Glenn K. Manacher, Terrance A. Mankus:
Incorporating Negative-Weight Vertices in Certain Vertex-Search Graph Algorithms. Inf. Process. Lett. 42(6): 293-294 (1992)
1990
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/ManacherMS90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/ManacherMS90
Glenn K. Manacher, Terrance A. Mankus, Carol Joan Smith:
An Optimum Theta (n log n) Algorithm for Finding a Canonical Hamiltonian Path and a Canonical Hamiltonian Circuit in a Set of Intervals. Inf. Process. Lett. 35(4): 205-211 (1990)

Coauthor Index

see FAQ

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.