Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,008,482 papers from all fields of science
Search
Sign In
Create Free Account
Martin Charles Golumbic
Known as:
Golumbic
Martin Charles Golumbic (born September 30, 1948) is a mathematician and computer scientist, best known for his work in algorithmic graph theory and…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Artificial intelligence
Discrete mathematics
European Coordinating Committee for Artificial Intelligence
Graph sandwich problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
RECOGNISING THE OVERLAP GRAPHS OF SUBTREES OF RESTRICTED TREES IS HARD
2019
Corpus ID: 260436539
The overlap graphs of subtrees in a tree (SOGs) generalise many other graphs classes with set representation characterisations…
Expand
2018
2018
Calling a Truce to the Cripto Wars: Why Congress and Tech Companies Must Work Together to Introduce New Solutions and Legislation to Regulate Encryption
Liz Kaminski
2018
Corpus ID: 169220118
On December 2, 2015 at 10:59 A.M., Syed Rizwan Farook and his wife, Tashfeen Malik, entered a conference room at the Inland…
Expand
2016
2016
Guest Editorial: Selected Papers from WG 2014
D. Kratsch
,
Ioan Todinca
Algorithmica
2016
Corpus ID: 253982660
Review
2014
Review
2014
Review of boolean functions: theory, algorithms, and applications by Yves Crama and Peter L. Hammer
Y. Crama
,
Peter L. Hammer
SIGA
2014
Corpus ID: 263864330
“[...] any system of propositions may be expressed by equations involving symbols x,y,z, which, whenever interpretation is…
Expand
2010
2010
A Slice-Based Decision Procedure for Type-Based Partial Orders
Elena Sherman
,
Brady J. Garvin
,
Matthew B. Dwyer
International Joint Conference on Automated…
2010
Corpus ID: 2541934
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths…
Expand
2008
2008
Minimax Trees in Linear Time
Paweł Gawrychowski
,
T. Gagie
arXiv.org
2008
Corpus ID: 16501977
A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted average of the leaves' depths, it…
Expand
2000
2000
Shiftable Interval Graphs
F. Malucelli
,
S. Nicoloso
2000
Corpus ID: 6354521
A Shiftable Interval Graph (SIG) is defined by a set of intervals and a set of windows associated with the intervals. Each…
Expand
1998
1998
On hereditary properties of composition graphs
Vadim E. Levit
,
Eugen Mandrescu
Discussiones Mathematicae Graph Theory
1998
Corpus ID: 18992384
The composition graph of a family of n+1 disjoint graphs fHi : 0 i ng is the graph H obtained by substituting the n vertices of…
Expand
1993
1993
Conjunctive Width al Constraint Satisfaction
R. Wallace
,
Eugene C. Freuder
1993
Corpus ID: 18457024
A constraint satisfaction problem may not admit a complete solution; in this case a good partial solution may be acceptable. This…
Expand
1972
1972
Measurement of Moisture Content in Seeds of Some North American Hardwoods
F. Bonner
1972
Corpus ID: 132420167
Current International rules (International Seed Testing Association, 1966) for determination of moisture content specify the air…
Expand