מרטין גולומביק - הפקולטה למדעי המחשב והמידע

פרסומים▼

35 years of math and AI: Editorial from the Founder and outgoing Editor-in-Chief, Golumbic, M. C., Feb 2025, In: Annals of Mathematics and Artificial Intelligence. 93, 1, p. 1-3 3 p.
On Dually-CPT and Strongly-CPT Posets, Alcón, L., Golumbic, M. C., Gudiño, N., Gutierrez, M. & Limouzy, V., Dec 2024, In: Order. 41, 3, p. 737-748 12 p.
Foreword, Diochnos, D. I., Golumbic, M. C. & Hoffman, F., 2024, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 14494 LNCS, p. v-vi
Containment orders–a lifelong journey, Golumbic, M. C., 2024, In: AKCE International Journal of Graphs and Combinatorics. 21, 2, p. 209-217 9 p.
ISAIM-2022: international symposium on artificial intelligence and mathematics, Diochnos, D. I., Golumbic, M. C. & Hoffman, F., Jan 2024, In: Annals of Mathematics and Artificial Intelligence. 92, 1, p. 1-4 4 p.
Combinatorics, graph theory, and computing, Golumbic, M. C., Hoffman, F. & Rosen, Z., Aug 2022, In: Journal of Algebraic Combinatorics. 56, 1, p. 1-3 3 p.
Encyclopedia of Mathematics and its Applications: Topics in Algorithmic Graph Theory, Beineke, L. W., Golumbic, M. C. & Wilson, R. J., 3 Jun 2021, Cambridge University Press. 349 p.
Preliminaries, Beineke, L. W., Golumbic, M. C. & Wilson, R. J., 3 Jun 2021, Encyclopedia of Mathematics and its Applications: Topics in Algorithmic Graph Theory. Cambridge University Press, p. 1-16 16 p.
Chordal graphs, Golumbic, M. C., 3 Jun 2021, Encyclopedia of Mathematics and its Applications: Topics in Algorithmic Graph Theory. Cambridge University Press, p. 130-151 22 p.
Dually and strongly chordal graphs, Brandstädt, A. & Golumbic, M. C., 3 Jun 2021, Encyclopedia of Mathematics and its Applications: Topics in Algorithmic Graph Theory. Cambridge University Press, p. 152-167 16 p.
Graph algorithms, Golumbic, M. C., 3 Jun 2021, Encyclopedia of Mathematics and its Applications: Topics in Algorithmic Graph Theory. Cambridge University Press, p. 17-32 16 p.
Foreword, Golumbic, M. C., 3 Jun 2021, Encyclopedia of Mathematics and its Applications: Topics in Algorithmic Graph Theory. Cambridge University Press, p. xi-xiv
The Complexity of Helly-B1-EPG graph Recognition, Bornstein, C. F., Golumbic, M. C., Santos, T. D., Souza, U. S. & Szwarcfiter, J. L., 2020, In: Discrete Mathematics and Theoretical Computer Science. 22, 1, 19.
The complexity of B1-EPG-Helly graph recognition, Bornstein, C. F., Santos, T. D., Souza , U. S., Szwarcfiter, J. L. & Golumbic, M., 2020, In: Discrete Mathematics and Theoretical Computer Science. 22, 1, p. 1-24
Edge intersection graphs of paths on a grid, Golumbic, M. C. & Morgenstern, G., 15 Nov 2019, 50 years of Combinatorics, Graph Theory, and Computing. CRC Press, p. 193-209 17 p.
Tolerance graphs, Golumbic, M., 2014, Handbook of Graph Theory. Gross, J. L., Yellen, J. & Zhang, P. (eds.). 2 ed. CRC Press, p. 1105-1120
The Mathematician and the Social Computer: A Look into the Future, Golumbic, M. C., 1 Jan 2014, Social Collective Intelligence: Combining the Powers of Humans and Machines to Build a Smarter Society. Springer International Publishing, p. 87-91 5 p.
The mathematician and the social computer: a look into the future, Golumbic, M., 2014, Social Collective Intelligence: : Combining the Powers of Humans and Machines to Build a Smarter Society. Miorandi, D., Maltese, V., Rovatsos, M., Nijholt, A. & Stewart, J. (eds.). Springer Verlag, p. 87-91
New Developments in Reactive Semantics, Golumbic, M. (Editor) & Gabbay, D. (Editor), 2012, In: Annals of Mathematics and Artificial Intelligence. 66, 1-4
Graph-Theoretic Concepts in Computer Science, Golumbic, M. (Editor), Stern, M. (Editor), Levy, A. (Editor) & Morgenstern, G. (Editor), 2012, Graph-Theoretic Concepts in Computer Science: 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers. 1 ed. Springer Berlin, Vol. 7551.
Read-once functions, Golumbic, M., 2011, Boolean Functions: Theory, Algorithms and Applications. Crama, Y. & Hammer, P. L. (eds.). Cambridge University Press, p. 448-486
Exploiting graph structure to cope with hard problems, Golumbic, M. (Editor), Brandstädt, A. (Editor), Heggernes, P. (Editor) & McConnell, R. (Editor), 2011, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 29 p.
Representing edge intersection graphs of paths on degree 4 trees, Golumbic, M. C., Lipshteyn, M. & Stern, M., 28 Apr 2008, In: Discrete Mathematics. 308, 8, p. 1381-1387 7 p.
The k-edge intersection graphs of paths in a tree, Golumbic, M. C., Lipshteyn, M. & Stern, M., 15 Feb 2008, In: Discrete Applied Mathematics. 156, 4, p. 451-461 11 p.
Recognizing chordal probe graphs and cycle-bicolorable graphs, Berry, A., Golumbic, M. C. & Lipshteyn, M., 2007, In: SIAM Journal on Discrete Mathematics. 21, 3, p. 573-591 19 p.
Rank-tolerance graph classes, Golumbic, M. C. & Jamison, R. E., Aug 2006, In: Journal of Graph Theory. 52, 4, p. 317-340 24 p.
Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees, Golumbic, M. C., Mintz, A. & Rotics, U., 15 Jun 2006, In: Discrete Applied Mathematics. 154, 10, p. 1465-1477 13 p.
Chain graphs have unbounded readability, Golumbic, M., Peled, U. N. & Rotics, U., 2006, p. 1-17.
Factoring Boolean functions using graph partitioning, Mintz, A. & Golumbic, M. C., 1 Aug 2005, In: Discrete Applied Mathematics. 149, 1-3, p. 131-153 23 p.
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems, Golumbic, M. C., Kaplan, H. & Verbin, E., 28 Jun 2005, In: Discrete Mathematics. 296, 1, p. 25-41 17 p.
Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications, Golumbic, M. (Editor) & Ben-Arroyo Hartman, I. (Editor), 2005, Springer. 292 p.
On the number of vertices belonging to all maximum stable sets of a graph, Golumbic, M., Boros, E. & E. Levit, V., 2002, In: Discrete Applied Mathematics. 124, 1-3, p. 17-25 9 p.
Complexity and algorithms for graph and hypergraph sandwich problems, Golumbic, M. C. & Wassermann, A., 1998, In: Graphs and Combinatorics. 14, 3, p. 223-239 17 p.
Irredundancy in circular arc graphs, Golumbic, M. C. & Laskar, R. C., 19 Jul 1993, In: Discrete Applied Mathematics. 44, 1-3, p. 79-89 11 p.
Counting endpoint sequences for interval orders and interval graphs, Belfer, A. & Golumbic, M. C., 28 Apr 1993, In: Discrete Mathematics. 114, 1-3, p. 23-39 17 p.
In Memory of Martin Farber-Introduction, Golumbic, M. (Editor) & Laskar, R. C. (Editor), 1993, In: Discrete Applied Mathematics. 44, p. 1-3
A combinatorial approach to temporal reasoning, Belfer, A. & Golumbic, M. C., Oct 1990, p. 774-780. 7 p.
Editorial welcome, Golumbic, M. C., Sep 1990, In: Annals of Mathematics and Artificial Intelligence. 1, 1-4, p. I-III
From data to knowledge-bases, Golumbic, M. & Grinberg , D., 1990, Advances in Artificial Intelligence: Natural Language and Knowledge-based Systems. Golumbic, M. C. (ed.). 1 ed. Springer, p. 269-294
Advances in artificial intelligence : natural language and knowledge-based systems, Golumbic, M. (Editor), 1990, New York: Springer Verlag. 303 p.
Spill code minimization techniques for optimizing compliers, Bernstein, D., Golumbic, M., Mansour, Y., Pinter, R., Goldin, D., Krawczyk, H. & Nahshon, I., 21 Jun 1989, In: SIGPLAN Notices (ACM Special Interest Group on Programming Languages). 24, 7, p. 258-263 6 p.
Constraint satisfiability algorithms for interactive student scheduling, Golumbic, M. (Editor) & Feldman, R. (Editor), 1989, In: Artificial Intelligence. IJCAI-89 , p. 1010-1016
Algorithmic aspects of intersection graphs and representation hypergraphs, Golumbic, M. C., Dec 1988, In: Graphs and Combinatorics. 4, 1, p. 307-321 15 p.
The edge intersection graphs of paths in a tree, Golumbic, M. C. & Jamison, R. E., Feb 1985, In: Journal of Combinatorial Theory. Series B. 38, 1, p. 8-22 15 p.
Algorithmic Graph Theory and Perfect Graphs, Golumbic, M., 1980, Academic Press. 284 p.
A GENERALIZATION OF DIRACS THEOREM* ON TRIANGULATED GRAPHS, Golumbic, M. C., May 1979, In: Annals of the New York Academy of Sciences. 319, 1, p. 242-246 5 p.
A note on perfect Gaussian elimination, Golumbic, M. C., 15 Jun 1978, In: Journal of Mathematical Analysis and Applications. 64, 2, p. 455-457 3 p.
Perfect Elimination and Chordal Bipartite Graphs, Golumbic, M. C. & Goss, C. F., 1978, In: Journal of Graph Theory. 2, 2, p. 155-163 9 p.
Trivially perfect graphs, Golumbic, M. C., 1978, In: Discrete Mathematics. 24, 1, p. 105-107 3 p.
The complexity of comparability graph recognition and coloring, Golumbic, M. C., Sep 1977, In: Computing. 18, 3, p. 199-208 10 p.

תחומי מחקר▼

אלגוריתמים בגרפים
בינה מלאכותית

הפקולטה למדעי המחשב והמידע

אוניברסיטת חיפה

פרופ' מרטין גולומביק

פרסומים▼

תחומי מחקר▼