Routing and path multicoloring. - Christos Nomikos; Aris Pagourtzis; Stathis Zachos (Inf. Process. Lett., 2001)

Canonicity and Completeness Results for Many-Valued Modal Logics. - Costas D. Koutras; Christos Nomikos; Pavlos Peppas (J. Appl. Non Class. Logics, 2002)

Minimizing Request Blocking in All-Optical Rings. - Christos Nomikos; Aris Pagourtzis; Stathis Zachos (INFOCOM, 2003)

Satisfying a maximum number of pre-routed requests in all-optical rings. - Christos Nomikos; Aris Pagourtzis; Stathis Zachos (Comput. Networks, 2003)

Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. - Christos Nomikos; Aris Pagourtzis; Katerina Potika; Stathis Zachos (NETWORKING, 2004)

A Proof Procedure For Temporal Logic Programming. - Manolis Gergatsoulis; Christos Nomikos (Int. J. Found. Comput. Sci., 2004)

A limit characterization for the number of spanning trees of graphs. - Stavros D. Nikolopoulos; Christos Nomikos; Panos Rondogiannis (Inf. Process. Lett., 2004)

A Sufficient Condition for Strong Equivalence Under the Well-Founded Semantics. - Christos Nomikos; Panos Rondogiannis; William W. Wadge (ICLP, 2005)

Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree. - Stratis Ioannidis; Christos Nomikos; Aris Pagourtzis; Stathis Zachos (Panhellenic Conference on Informatics, 2005)

Temporal stratification tests for linear and branching-time deductive databases. - Christos Nomikos; Panos Rondogiannis; Manolis Gergatsoulis (Theor. Comput. Sci., 2005)

Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost. - Christos Nomikos; Aris Pagourtzis; Katerina Potika; Stathis Zachos (Comput. Networks, 2006)

Randomized and Approximation Algorithms for Blue-Red Matching. - Christos Nomikos; Aris Pagourtzis; Stathis Zachos (MFCS, 2007)

On the Semantic Approaches to Boolean Grammars. - Vassilis Kountouriotis; Christos Nomikos; Panos Rondogiannis (Topological and Game-Theoretic Aspects of Infinite Computations, 2008)

Locally stratified Boolean grammars. - Christos Nomikos; Panos Rondogiannis (Inf. Comput., 2008)

On a Simple 3-valued Modal Language and a 3-valued Logic of 'not-fully-justified' Belief. - Costas D. Koutras; Christos Nomikos; Pavlos Peppas (Log. J. IGPL, 2008)

Well-founded semantics for Boolean grammars. - Vassilis Kountouriotis; Christos Nomikos; Panos Rondogiannis (Inf. Comput., 2009)

Strong equivalence of logic programs under the infinite-valued semantics. - Christos Nomikos; Panos Rondogiannis; William W. Wadge (Inf. Process. Lett., 2009)

A game-theoretic characterization of Boolean grammars. - Vassilis Kountouriotis; Christos Nomikos; Panos Rondogiannis (Theor. Comput. Sci., 2011)

Notions of Bisimulation for Heyting-Valued Modal Languages. - Pantelis E. Eleftheriou; Costas D. Koutras; Christos Nomikos (J. Log. Comput., 2012)

An Algorithm for Querying Linked Data Using Map-Reduce. - Manolis Gergatsoulis; Christos Nomikos; Eleftherios Kalogeros; Matthew Damigos (Globe, 2013)

A Map-Reduce algorithm for querying linked data based on query decomposition into stars. - Christos Nomikos; Manolis Gergatsoulis; Eleftherios Kalogeros; Matthew Damigos (EDBT/ICDT Workshops, 2014)

On the 'in many cases' Modality: Tableaux, Decidability, Complexity, Variants. - Costas D. Koutras; Christos Moyzes; Christos Nomikos; Yorgos Zikos (SETN, 2014)

Stathis Zachos at 70! - Eleni Bakali; Panagiotis Cheilaris; Dimitris Fotakis 001; Martin Fürer; Costas D. Koutras; Euripides Markou; Christos Nomikos; Aris Pagourtzis; Christos H. Papadimitriou; Nikolaos S. Papaspyrou; Katerina Potika (CIAC, 2017)

Game semantics for non-monotonic intensional logic programming. - Chrysida Galanaki; Christos Nomikos; Panos Rondogiannis (Ann. Pure Appl. Log., 2017)

The Expressive Power of Higher-Order Datalog. - Angelos Charalambidis; Christos Nomikos; Panos Rondogiannis (Theory Pract. Log. Program., 2019)

Topological semantics for default conditional logic: preliminary report. - Costas D. Koutras; Christos Nomikos (SAC, 2022)

Default consequence relations from topology and measure theory. - Costas D. Koutras; Konstantinos Liaskos; Christos Moyzes; Christos Nomikos; Christos Rantsoudis (Ann. Math. Artif. Intell., 2022)

Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective. - Angelos Charalambidis; Christos Nomikos; Panos Rondogiannis (Theory Pract. Log. Program., 2022)

On weak filters and ultrafilters: Set theory from (and for) knowledge representation. - Costas D. Koutras; Christos Moyzes; Christos Nomikos; Konstantinos Tsaprounis; Yorgos Zikos (Log. J. IGPL, 2023)

Efficient query evaluation techniques over large amount of distributed linked data. - Eleftherios Kalogeros; Manolis Gergatsoulis; Matthew Damigos; Christos Nomikos (Inf. Syst., 2023)

The Power of Negation in Higher-Order Datalog. - Angelos Charalambidis; Babis Kostopoulos; Christos Nomikos; Panos Rondogiannis (CoRR, 2025)