[ 2022 ]


[ 116 ]
Ilias S. Kotsireas and Panos M. Pardalos. Preface selected revised papers from the LION 14 conference. Ann. Math. Artif. Intell., 90:677, 2022. [ http ]
@article{DBLP:journals/amai/KotsireasP22,
 author = {Ilias S. Kotsireas and
Panos M. Pardalos},
 doi = {10.1007/s10472-022-09808-z},
 journal = {Ann. Math. Artif. Intell.},
 pages = {677},
 title = {Preface selected revised papers from the {LION} 14 conference},
 url = {https://doi.org/10.1007/s10472-022-09808-z},
 volume = {90},
 year = {2022}
}
[ 115 ]
Curtis Bright, Ilias S. Kotsireas, and Vijay Ganesh. When satisfiability solving meets symbolic computation. Commun. ACM, 65:64--72, 2022. [ http ]
@article{DBLP:journals/cacm/BrightKG22,
 author = {Curtis Bright and
Ilias S. Kotsireas and
Vijay Ganesh},
 doi = {10.1145/3500921},
 journal = {Commun. {ACM}},
 pages = {64--72},
 title = {When satisfiability solving meets symbolic computation},
 url = {https://doi.org/10.1145/3500921},
 volume = {65},
 year = {2022}
}
[ 114 ]
Ilias S. Kotsireas, Panos M. Pardalos, Alexander Semenov, William T. Trevena, and Michael N. Vrahatis. Survey of methods for solving systems of nonlinear equations, part I: root-finding approaches. CoRR, abs/2208.08530, 2022. [ http ]
@article{DBLP:journals/corr/abs-2208-08530,
 author = {Ilias S. Kotsireas and
Panos M. Pardalos and
Alexander Semenov and
William T. Trevena and
Michael N. Vrahatis},
 doi = {10.48550/arXiv.2208.08530},
 journal = {CoRR},
 title = {Survey of Methods for Solving Systems of Nonlinear Equations, Part
{I:} Root-finding Approaches},
 url = {https://doi.org/10.48550/arXiv.2208.08530},
 volume = {abs/2208.08530},
 year = {2022}
}
[ 113 ]
Ilias S. Kotsireas, Panos M. Pardalos, Alexander Semenov, William T. Trevena, and Michael N. Vrahatis. Survey of methods for solving systems of nonlinear equations, part II: optimization based approaches. CoRR, abs/2208.08532, 2022. [ http ]
@article{DBLP:journals/corr/abs-2208-08532,
 author = {Ilias S. Kotsireas and
Panos M. Pardalos and
Alexander Semenov and
William T. Trevena and
Michael N. Vrahatis},
 doi = {10.48550/arXiv.2208.08532},
 journal = {CoRR},
 title = {Survey of Methods for Solving Systems of Nonlinear Equations, Part
{II:} Optimization Based Approaches},
 url = {https://doi.org/10.48550/arXiv.2208.08532},
 volume = {abs/2208.08532},
 year = {2022}
}
[ 112 ]
Ilias S. Kotsireas. Review of "handbook of heuristics". Oper. Res. Forum, 3, 2022. [ http ]
@article{DBLP:journals/orf/Kotsireas22,
 author = {Ilias S. Kotsireas},
 doi = {10.1007/s43069-022-00149-5},
 journal = {Oper. Res. Forum},
 title = {Review of "Handbook of Heuristics"},
 url = {https://doi.org/10.1007/s43069-022-00149-5},
 volume = {3},
 year = {2022}
}
[ 111 ]
Evangelos Bartzos, Ioannis Z. Emiris, Ilias S. Kotsireas, and Charalambos Tzamos. Bounding the number of roots of multi-homogeneous systems. In Marc Moreno Maza and Lihong Zhi, editors, ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4 - 7, 2022, pages 255--262. ACM, 2022. [ http ]
@inproceedings{DBLP:conf/issac/BartzosEKT22,
 author = {Evangelos Bartzos and
Ioannis Z. Emiris and
Ilias S. Kotsireas and
Charalambos Tzamos},
 booktitle = {{ISSAC} '22: International Symposium on Symbolic and Algebraic Computation,
Villeneuve-d'Ascq, France, July 4 - 7, 2022},
 doi = {10.1145/3476446.3536189},
 editor = {Marc Moreno Maza and
Lihong Zhi},
 pages = {255--262},
 publisher = {{ACM}},
 title = {Bounding the Number of Roots of Multi-Homogeneous Systems},
 url = {https://doi.org/10.1145/3476446.3536189},
 year = {2022}
}


[ 2021 ]


[ 110 ]
Jonathan S. Turner, Ilias S. Kotsireas, Dursun A. Bulutoglu, and Andrew J. Geyer. A legendre pair of length 77 using complementary binary matrices with fixed marginals. Des. Codes Cryptogr., 89:1321--1333, 2021. [ http ]
@article{DBLP:journals/dcc/TurnerKBG21,
 author = {Jonathan S. Turner and
Ilias S. Kotsireas and
Dursun A. Bulutoglu and
Andrew J. Geyer},
 doi = {10.1007/s10623-021-00862-y},
 journal = {Des. Codes Cryptogr.},
 pages = {1321--1333},
 title = {A Legendre pair of length 77 using complementary binary matrices with
fixed marginals},
 url = {https://doi.org/10.1007/s10623-021-00862-y},
 volume = {89},
 year = {2021}
}
[ 109 ]
Curtis Bright, Ilias S. Kotsireas, Albert Heinle, and Vijay Ganesh. Complex golay pairs up to length 28: A search via computer algebra and programmatic SAT. J. Symb. Comput., 102:153--172, 2021. [ http ]
@article{DBLP:journals/jsc/BrightKHG21,
 author = {Curtis Bright and
Ilias S. Kotsireas and
Albert Heinle and
Vijay Ganesh},
 doi = {10.1016/j.jsc.2019.10.013},
 journal = {J. Symb. Comput.},
 pages = {153--172},
 title = {Complex Golay pairs up to length 28: {A} search via computer algebra
and programmatic {SAT}},
 url = {https://doi.org/10.1016/j.jsc.2019.10.013},
 volume = {102},
 year = {2021}
}
[ 108 ]
Kotsireas, Ilias and Koutschan, Christoph. Legendre pairs of lengths 03. J. Combin. Des., 29:870--887, 2021. [ http ]
@article{MR4373597,
 author = {Kotsireas, Ilias and Koutschan, Christoph},
 doi = {10.1002/jcd.21806},
 journal = {J. Combin. Des.},
 pages = {870--887},
 title = {Legendre pairs of lengths {$\ell\equiv 0\pmod 3$}},
 url = {https://doi.org/10.1002/jcd.21806},
 volume = {29},
 year = {2021}
}
[ 107 ]
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, and Vijay Ganesh. A sat-based resolution of lam's problem. In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021, pages 3669--3676. AAAI Press, 2021. [ http ]
@inproceedings{DBLP:conf/aaai/BrightCSKG21,
 author = {Curtis Bright and
Kevin K. H. Cheung and
Brett Stevens and
Ilias S. Kotsireas and
Vijay Ganesh},
 booktitle = {Thirty-Fifth {AAAI} Conference on Artificial Intelligence, {AAAI}
2021, Thirty-Third Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2021, The Eleventh Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2021, Virtual Event, February 2-9,
2021},
 pages = {3669--3676},
 publisher = {{AAAI} Press},
 title = {A SAT-based Resolution of Lam's Problem},
 url = {https://ojs.aaai.org/index.php/AAAI/article/view/16483},
 year = {2021}
}
[ 106 ]
Dimitris E. Simos, Panos M. Pardalos, and Ilias S. Kotsireas, editors. Learning and Intelligent Optimization - 15th International Conference, LION 15, Athens, Greece, June 20-25, 2021, Revised Selected Papers, volume 12931. Springer, 2021. [ http ]
@proceedings{DBLP:conf/lion/2021,
 doi = {10.1007/978-3-030-92121-7},
 editor = {Dimitris E. Simos and
Panos M. Pardalos and
Ilias S. Kotsireas},
 publisher = {Springer},
 title = {Learning and Intelligent Optimization - 15th International Conference,
{LION} 15, Athens, Greece, June 20-25, 2021, Revised Selected Papers},
 url = {https://doi.org/10.1007/978-3-030-92121-7},
 volume = {12931},
 year = {2021}
}
[ 105 ]
Robert M. Corless, Jürgen Gerhard, and Ilias S. Kotsireas, editors. Maple in Mathematics Education and Research - 4th Maple Conference, MC 2020, Waterloo, Ontario, Canada, November 2-6, 2020, Revised Selected Papers, volume 1414. Springer, 2021. [ http ]
@proceedings{DBLP:conf/mc2/2020,
 doi = {10.1007/978-3-030-81698-8},
 editor = {Robert M. Corless and
J{\"{u}}rgen Gerhard and
Ilias S. Kotsireas},
 publisher = {Springer},
 title = {Maple in Mathematics Education and Research - 4th Maple Conference,
{MC} 2020, Waterloo, Ontario, Canada, November 2-6, 2020, Revised
Selected Papers},
 url = {https://doi.org/10.1007/978-3-030-81698-8},
 volume = {1414},
 year = {2021}
}


[ 2020 ]


[ 104 ]
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Dominique Roy, Ilias S. Kotsireas, and Vijay Ganesh. A nonexistence certificate for projective planes of order ten with weight 15 codewords. Appl. Algebra Eng. Commun. Comput., 31:195--213, 2020. [ http ]
@article{DBLP:journals/aaecc/BrightCSRKG20,
 author = {Curtis Bright and
Kevin K. H. Cheung and
Brett Stevens and
Dominique Roy and
Ilias S. Kotsireas and
Vijay Ganesh},
 doi = {10.1007/s00200-020-00426-y},
 journal = {Appl. Algebra Eng. Commun. Comput.},
 pages = {195--213},
 title = {A nonexistence certificate for projective planes of order ten with
weight 15 codewords},
 url = {https://doi.org/10.1007/s00200-020-00426-y},
 volume = {31},
 year = {2020}
}
[ 103 ]
Kenza Guenda, Iiro S. Honkala, Ilias S. Kotsireas, Teo Mora, and Qiang Wang. Special issue: "computer algebra and application to combinatorics, coding theory and cryptography" ACA 2019, montreal, canada, july 16-20, 2019. Appl. Algebra Eng. Commun. Comput., 31:171--172, 2020. [ http ]
@article{DBLP:journals/aaecc/GuendaHKMW20,
 author = {Kenza Guenda and
Iiro S. Honkala and
Ilias S. Kotsireas and
Teo Mora and
Qiang Wang},
 doi = {10.1007/s00200-020-00436-w},
 journal = {Appl. Algebra Eng. Commun. Comput.},
 pages = {171--172},
 title = {Special Issue: "Computer Algebra and Application to Combinatorics,
Coding Theory and Cryptography" {ACA} 2019, Montreal, Canada, July
16-20, 2019},
 url = {https://doi.org/10.1007/s00200-020-00436-w},
 volume = {31},
 year = {2020}
}
[ 102 ]
Ilias S. Kotsireas, Temur Kutsia, and Dimitris E. Simos. Constructing orthogonal designs in powers of two via symbolic computation and rewriting techniques. Ann. Math. Artif. Intell., 88:213--236, 2020. [ http ]
@article{DBLP:journals/amai/KotsireasKS20,
 author = {Ilias S. Kotsireas and
Temur Kutsia and
Dimitris E. Simos},
 doi = {10.1007/s10472-018-9607-9},
 journal = {Ann. Math. Artif. Intell.},
 pages = {213--236},
 title = {Constructing orthogonal designs in powers of two via symbolic computation
and rewriting techniques},
 url = {https://doi.org/10.1007/s10472-018-9607-9},
 volume = {88},
 year = {2020}
}
[ 101 ]
Ilias S. Kotsireas and Panos M. Pardalos. Guest editorial: revised selected papers from the LION 12 conference. Ann. Math. Artif. Intell., 88:1--2, 2020. [ http ]
@article{DBLP:journals/amai/KotsireasP20,
 author = {Ilias S. Kotsireas and
Panos M. Pardalos},
 doi = {10.1007/s10472-019-09677-z},
 journal = {Ann. Math. Artif. Intell.},
 pages = {1--2},
 title = {Guest editorial: revised selected papers from the {LION} 12 conference},
 url = {https://doi.org/10.1007/s10472-019-09677-z},
 volume = {88},
 year = {2020}
}
[ 100 ]
Curtis Bright, Ilias S. Kotsireas, and Vijay Ganesh. Applying computer algebra systems with SAT solvers to the williamson conjecture. J. Symb. Comput., 100:187--209, 2020. [ http ]
@article{DBLP:journals/jsc/BrightKG20,
 author = {Curtis Bright and
Ilias S. Kotsireas and
Vijay Ganesh},
 doi = {10.1016/j.jsc.2019.07.024},
 journal = {J. Symb. Comput.},
 pages = {187--209},
 title = {Applying computer algebra systems with {SAT} solvers to the Williamson
conjecture},
 url = {https://doi.org/10.1016/j.jsc.2019.07.024},
 volume = {100},
 year = {2020}
}
[ 99 ]
Anna Maria Bigatti, Francisco Botana, Thierry N. Dana-Picard, Felipe Gago, Ilias S. Kotsireas, Manuel Ladra, and Wei Li. Foreword. Math. Comput. Sci., 14:191--192, 2020. [ http ]
@article{DBLP:journals/mics/BigattiBDGKLL20,
 author = {Anna Maria Bigatti and
Francisco Botana and
Thierry N. Dana{-}Picard and
Felipe Gago and
Ilias S. Kotsireas and
Manuel Ladra and
Wei Li},
 doi = {10.1007/s11786-019-00445-0},
 journal = {Math. Comput. Sci.},
 pages = {191--192},
 title = {Foreword},
 url = {https://doi.org/10.1007/s11786-019-00445-0},
 volume = {14},
 year = {2020}
}
[ 98 ]
Curtis Bright, Ilias S. Kotsireas, and Vijay Ganesh. New infinite families of perfect quaternion sequences and williamson sequences. IEEE Trans. Inf. Theory, 66:7739--7751, 2020. [ http ]
@article{DBLP:journals/tit/BrightKG20,
 author = {Curtis Bright and
Ilias S. Kotsireas and
Vijay Ganesh},
 doi = {10.1109/TIT.2020.3016510},
 journal = {{IEEE} Trans. Inf. Theory},
 pages = {7739--7751},
 title = {New Infinite Families of Perfect Quaternion Sequences and Williamson
Sequences},
 url = {https://doi.org/10.1109/TIT.2020.3016510},
 volume = {66},
 year = {2020}
}
[ 97 ]
Goldberger, Assaf and Kotsireas, Ilias. Formal orthogonal pairs via monomial representations and cohomology. Sém. Lothar. Combin., 84B:Art. 68, 12, 2020.
@article{MR4138696,
 author = {Goldberger, Assaf and Kotsireas, Ilias},
 journal = {S\'{e}m. Lothar. Combin.},
 pages = {Art. 68, 12},
 title = {Formal orthogonal pairs via monomial representations and
cohomology},
 volume = {84B},
 year = {2020}
}
[ 96 ]
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, and Vijay Ganesh. Unsatisfiability proofs for weight 16 codewords in lam's problem. In Christian Bessiere, editor, Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pages 1460--1466. ijcai.org, 2020. [ http ]
@inproceedings{DBLP:conf/ijcai/BrightCSKG20,
 author = {Curtis Bright and
Kevin K. H. Cheung and
Brett Stevens and
Ilias S. Kotsireas and
Vijay Ganesh},
 booktitle = {Proceedings of the Twenty-Ninth International Joint Conference on
Artificial Intelligence, {IJCAI} 2020},
 doi = {10.24963/ijcai.2020/203},
 editor = {Christian Bessiere},
 pages = {1460--1466},
 publisher = {ijcai.org},
 title = {Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem},
 url = {https://doi.org/10.24963/ijcai.2020/203},
 year = {2020}
}
[ 95 ]
Pascal Fontaine, Konstantin Korovin, Ilias S. Kotsireas, Philipp Rümmer, and Sophie Tourret, editors. Joint Proceedings of the 7th Workshop on Practical Aspects of Automated Reasoning (PAAR) and the 5th Satisfiability Checking and Symbolic Computation Workshop (SC-Square) Workshop, 2020 co-located with the 10th International Joint Conference on Automated Reasoning (IJCAR 2020), Paris, France, June-July, 2020 (Virtual), volume 2752. CEUR-WS.org, 2020. [ http ]
@proceedings{DBLP:conf/cade/2020paar,
 editor = {Pascal Fontaine and
Konstantin Korovin and
Ilias S. Kotsireas and
Philipp R{\"{u}}mmer and
Sophie Tourret},
 publisher = {CEUR-WS.org},
 title = {Joint Proceedings of the 7th Workshop on Practical Aspects of Automated
Reasoning {(PAAR)} and the 5th Satisfiability Checking and Symbolic
Computation Workshop (SC-Square) Workshop, 2020 co-located with the
10th International Joint Conference on Automated Reasoning {(IJCAR}
2020), Paris, France, June-July, 2020 (Virtual)},
 url = {http://ceur-ws.org/Vol-2752},
 volume = {2752},
 year = {2020}
}
[ 94 ]
Ilias S. Kotsireas and Panos M. Pardalos, editors. Learning and Intelligent Optimization - 14th International Conference, LION 14, Athens, Greece, May 24-28, 2020, Revised Selected Papers, volume 12096. Springer, 2020. [ http ]
@proceedings{DBLP:conf/lion/2020,
 doi = {10.1007/978-3-030-53552-0},
 editor = {Ilias S. Kotsireas and
Panos M. Pardalos},
 publisher = {Springer},
 title = {Learning and Intelligent Optimization - 14th International Conference,
{LION} 14, Athens, Greece, May 24-28, 2020, Revised Selected Papers},
 url = {https://doi.org/10.1007/978-3-030-53552-0},
 volume = {12096},
 year = {2020}
}
[ 93 ]
Panos M. Pardalos, Ilias S. Kotsireas, Yike Guo, and William J. Knottenbelt, editors. Mathematical Research for Blockchain Economy, 1st International Conference, MARBLE 2019, Santorini, Greece, May 6-9, 2019. Springer, 2020. [ http ]
@proceedings{DBLP:conf/marble/2019,
 doi = {10.1007/978-3-030-37110-4},
 editor = {Panos M. Pardalos and
Ilias S. Kotsireas and
Yike Guo and
William J. Knottenbelt},
 publisher = {Springer},
 title = {Mathematical Research for Blockchain Economy, 1st International Conference,
{MARBLE} 2019, Santorini, Greece, May 6-9, 2019},
 url = {https://doi.org/10.1007/978-3-030-37110-4},
 year = {2020}
}
[ 92 ]
Jürgen Gerhard and Ilias S. Kotsireas, editors. Maple in Mathematics Education and Research - Third Maple Conference, MC 2019, Waterloo, Ontario, Canada, October 15-17, 2019, Proceedings, volume 1125. Springer, 2020. [ http ]
@proceedings{DBLP:conf/mc2/2019,
 doi = {10.1007/978-3-030-41258-6},
 editor = {J{\"{u}}rgen Gerhard and
Ilias S. Kotsireas},
 publisher = {Springer},
 title = {Maple in Mathematics Education and Research - Third Maple Conference,
{MC} 2019, Waterloo, Ontario, Canada, October 15-17, 2019, Proceedings},
 url = {https://doi.org/10.1007/978-3-030-41258-6},
 volume = {1125},
 year = {2020}
}


[ 2019 ]


[ 91 ]
Curtis Bright, Dragomir Z. Dokovic, Ilias S. Kotsireas, and Vijay Ganesh. The SAT+CAS method for combinatorial search with applications to best matrices. Ann. Math. Artif. Intell., 87:321--342, 2019. [ http ]
@article{DBLP:journals/amai/BrightDKG19,
 author = {Curtis Bright and
Dragomir Z. Dokovic and
Ilias S. Kotsireas and
Vijay Ganesh},
 doi = {10.1007/s10472-019-09681-3},
 journal = {Ann. Math. Artif. Intell.},
 pages = {321--342},
 title = {The {SAT+CAS} method for combinatorial search with applications to
best matrices},
 url = {https://doi.org/10.1007/s10472-019-09681-3},
 volume = {87},
 year = {2019}
}
[ 90 ]
Jürgen Gerhard and Ilias S. Kotsireas. Maple conference 2019. ACM Commun. Comput. Algebra, 53:182, 2019. [ http ]
@article{DBLP:journals/cca/GerhardK19,
 author = {J{\"{u}}rgen Gerhard and
Ilias S. Kotsireas},
 doi = {10.1145/3388974.3388976},
 journal = {{ACM} Commun. Comput. Algebra},
 pages = {182},
 title = {Maple Conference 2019},
 url = {https://doi.org/10.1145/3388974.3388976},
 volume = {53},
 year = {2019}
}
[ 89 ]
Panagiotis Vlamos, Ilias S. Kotsireas, and Dimitrios Vlachakis. Complexity in medical informatics. Complex., 2019:8658124:1--8658124:2, 2019. [ http ]
@article{DBLP:journals/complexity/VlamosKV19,
 author = {Panagiotis Vlamos and
Ilias S. Kotsireas and
Dimitrios Vlachakis},
 doi = {10.1155/2019/8658124},
 journal = {Complex.},
 pages = {8658124:1--8658124:2},
 title = {Complexity in Medical Informatics},
 url = {https://doi.org/10.1155/2019/8658124},
 volume = {2019},
 year = {2019}
}
[ 88 ]
Michel Beaudin, Thierry N. Dana-Picard, Alexander B. Levin, Christoph Koutschan, Ilias S. Kotsireas, and Daniel Robertz. Foreword. Math. Comput. Sci., 13:1--3, 2019. [ http ]
@article{DBLP:journals/mics/BeaudinDLKKR19,
 author = {Michel Beaudin and
Thierry N. Dana{-}Picard and
Alexander B. Levin and
Christoph Koutschan and
Ilias S. Kotsireas and
Daniel Robertz},
 doi = {10.1007/s11786-019-00391-x},
 journal = {Math. Comput. Sci.},
 pages = {1--3},
 title = {Foreword},
 url = {https://doi.org/10.1007/s11786-019-00391-x},
 volume = {13},
 year = {2019}
}
[ 87 ]
Dimitris Souravlias, Ilias S. Kotsireas, Panos M. Pardalos, and Konstantinos E. Parsopoulos. Parallel algorithm portfolios with performance forecasting. Optim. Methods Softw., 34:1231--1250, 2019. [ http ]
@article{DBLP:journals/oms/SouravliasKPP19,
 author = {Dimitris Souravlias and
Ilias S. Kotsireas and
Panos M. Pardalos and
Konstantinos E. Parsopoulos},
 doi = {10.1080/10556788.2018.1484123},
 journal = {Optim. Methods Softw.},
 pages = {1231--1250},
 title = {Parallel algorithm portfolios with performance forecasting},
 url = {https://doi.org/10.1080/10556788.2018.1484123},
 volume = {34},
 year = {2019}
}
[ 86 ]
Manfred Droste, Ilias S. Kotsireas, and Robert Rolland. Preface. Theor. Comput. Sci., 800:1--2, 2019. [ http ]
@article{DBLP:journals/tcs/DrosteKR19,
 author = {Manfred Droste and
Ilias S. Kotsireas and
Robert Rolland},
 doi = {10.1016/j.tcs.2019.10.009},
 journal = {Theor. Comput. Sci.},
 pages = {1--2},
 title = {Preface},
 url = {https://doi.org/10.1016/j.tcs.2019.10.009},
 volume = {800},
 year = {2019}
}
[ 85 ]
oković, Dragomir Ž. and Kotsireas, Ilias S. Computational methods for difference families in finite abelian groups. Spec. Matrices, 7:127--141, 2019. [ http ]
@article{MR4012197,
 author = {\Dbar okovi\'{c}, Dragomir \v{Z}. and Kotsireas, Ilias S.},
 doi = {10.1515/spma-2019-0012},
 journal = {Spec. Matrices},
 pages = {127--141},
 title = {Computational methods for difference families in finite
abelian groups},
 url = {https://doi.org/10.1515/spma-2019-0012},
 volume = {7},
 year = {2019}
}
[ 84 ]
Imbach, Rémi, Pan, Victor Y., Yap, Chee, Kotsireas, Ilias S., and Zaderman, Vitaly. Root-finding with implicit deflation. In Computer algebra in scientific computing, volume 11661, pages 236--245. Springer, Cham, 2019. [ http ]
@incollection{MR3996551,
 author = {Imbach, R\'{e}mi and Pan, Victor Y. and Yap, Chee and Kotsireas,
Ilias S. and Zaderman, Vitaly},
 booktitle = {Computer algebra in scientific computing},
 doi = {10.1007/978-3-030-26831-2_16},
 pages = {236--245},
 publisher = {Springer, Cham},
 title = {Root-finding with implicit deflation},
 url = {https://doi.org/10.1007/978-3-030-26831-2_16},
 volume = {11661},
 year = {2019}
}
[ 83 ]
Kotsireas, Ilias S., Liu, Youtong, and Yang, Jing. PAF reconstruction with the orbits method. In Computer algebra in scientific computing, volume 11661, pages 315--329. Springer, Cham, 2019. [ http ]
@incollection{MR3996556,
 author = {Kotsireas, Ilias S. and Liu, Youtong and Yang, Jing},
 booktitle = {Computer algebra in scientific computing},
 doi = {10.1007/978-3-030-26831-2_21},
 pages = {315--329},
 publisher = {Springer, Cham},
 title = {P{AF} reconstruction with the orbits method},
 url = {https://doi.org/10.1007/978-3-030-26831-2_21},
 volume = {11661},
 year = {2019}
}
[ 82 ]
Curtis Bright, Dragomir Z. Ðokovic, Ilias S. Kotsireas, and Vijay Ganesh. A SAT+CAS approach to finding good matrices: New examples and counterexamples. In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019, pages 1435--1442. AAAI Press, 2019. [ http ]
@inproceedings{DBLP:conf/aaai/BrightKG19,
 author = {Curtis Bright and
Dragomir Z. {\DH}okovic and
Ilias S. Kotsireas and
Vijay Ganesh},
 booktitle = {The Thirty-Third {AAAI} Conference on Artificial Intelligence, {AAAI}
2019, The Thirty-First Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2019, The Ninth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2019, Honolulu, Hawaii,
USA, January 27 - February 1, 2019},
 doi = {10.1609/aaai.v33i01.33011435},
 pages = {1435--1442},
 publisher = {{AAAI} Press},
 title = {A {SAT+CAS} Approach to Finding Good Matrices: New Examples and Counterexamples},
 url = {https://doi.org/10.1609/aaai.v33i01.33011435},
 year = {2019}
}
[ 81 ]
Ludwig Kampel, Dimitris E. Simos, Bernhard Garn, Ilias S. Kotsireas, and Evgeny Zhereshchin. Algebraic models for arbitrary strength covering arrays over v-ary alphabets. In Miroslav Ciric, Manfred Droste, and Jean-Éric Pin, editors, Algebraic Informatics - 8th International Conference, CAI 2019, Niš, Serbia, June 30 - July 4, 2019, Proceedings, volume 11545, pages 177--189. Springer, 2019. [ http ]
@inproceedings{DBLP:conf/cai/KampelSGKZ19,
 author = {Ludwig Kampel and
Dimitris E. Simos and
Bernhard Garn and
Ilias S. Kotsireas and
Evgeny Zhereshchin},
 booktitle = {Algebraic Informatics - 8th International Conference, {CAI} 2019,
Ni{\v{s}}, Serbia, June 30 - July 4, 2019, Proceedings},
 doi = {10.1007/978-3-030-21363-3_15},
 editor = {Miroslav Ciric and
Manfred Droste and
Jean{-}{\'{E}}ric Pin},
 pages = {177--189},
 publisher = {Springer},
 title = {Algebraic Models for Arbitrary Strength Covering Arrays over v-ary
Alphabets},
 url = {https://doi.org/10.1007/978-3-030-21363-3_15},
 volume = {11545},
 year = {2019}
}
[ 80 ]
Curtis Bright, Ilias S. Kotsireas, and Vijay Ganesh. SAT solvers and computer algebra systems: a powerful combination for mathematics. In Tima Pakfetrat, Guy-Vincent Jourdan, Kostas Kontogiannis, and Robert F. Enenkel, editors, Proceedings of the 29th Annual International Conference on Computer Science and Software Engineering, CASCON 2019, Markham, Ontario, Canada, November 4-6, 2019, pages 323--328. ACM, 2019. [ http ]
@inproceedings{DBLP:conf/cascon/BrightKG19,
 author = {Curtis Bright and
Ilias S. Kotsireas and
Vijay Ganesh},
 booktitle = {Proceedings of the 29th Annual International Conference on Computer
Science and Software Engineering, {CASCON} 2019, Markham, Ontario,
Canada, November 4-6, 2019},
 doi = {10.5555/3370272.3370309},
 editor = {Tima Pakfetrat and
Guy{-}Vincent Jourdan and
Kostas Kontogiannis and
Robert F. Enenkel},
 pages = {323--328},
 publisher = {{ACM}},
 title = {{SAT} solvers and computer algebra systems: a powerful combination
for mathematics},
 url = {https://dl.acm.org/doi/10.5555/3370272.3370309},
 year = {2019}
}
[ 79 ]
Ludwig Kampel, Michael Wagner, Ilias S. Kotsireas, and Dimitris E. Simos. How to use boltzmann machines and neural networks for covering array generation. In Nikolaos F. Matsatsinis, Yannis Marinakis, and Panos M. Pardalos, editors, Learning and Intelligent Optimization - 13th International Conference, LION 13, Chania, Crete, Greece, May 27-31, 2019, Revised Selected Papers, volume 11968, pages 53--68. Springer, 2019. [ http ]
@inproceedings{DBLP:conf/lion/KampelWKS19,
 author = {Ludwig Kampel and
Michael Wagner and
Ilias S. Kotsireas and
Dimitris E. Simos},
 booktitle = {Learning and Intelligent Optimization - 13th International Conference,
{LION} 13, Chania, Crete, Greece, May 27-31, 2019, Revised Selected
Papers},
 doi = {10.1007/978-3-030-38629-0_5},
 editor = {Nikolaos F. Matsatsinis and
Yannis Marinakis and
Panos M. Pardalos},
 pages = {53--68},
 publisher = {Springer},
 title = {How to Use Boltzmann Machines and Neural Networks for Covering Array
Generation},
 url = {https://doi.org/10.1007/978-3-030-38629-0_5},
 volume = {11968},
 year = {2019}
}
[ 78 ]
Curtis Bright, Jürgen Gerhard, Ilias S. Kotsireas, and Vijay Ganesh. Effective problem solving using SAT solvers. In Jürgen Gerhard and Ilias S. Kotsireas, editors, Maple in Mathematics Education and Research - Third Maple Conference, MC 2019, Waterloo, Ontario, Canada, October 15-17, 2019, Proceedings, volume 1125, pages 205--219. Springer, 2019. [ http ]
@inproceedings{DBLP:conf/mc2/BrightGKG19,
 author = {Curtis Bright and
J{\"{u}}rgen Gerhard and
Ilias S. Kotsireas and
Vijay Ganesh},
 booktitle = {Maple in Mathematics Education and Research - Third Maple Conference,
{MC} 2019, Waterloo, Ontario, Canada, October 15-17, 2019, Proceedings},
 doi = {10.1007/978-3-030-41258-6_15},
 editor = {J{\"{u}}rgen Gerhard and
Ilias S. Kotsireas},
 pages = {205--219},
 publisher = {Springer},
 title = {Effective Problem Solving Using {SAT} Solvers},
 url = {https://doi.org/10.1007/978-3-030-41258-6_15},
 volume = {1125},
 year = {2019}
}
[ 77 ]
Roberto Battiti, Mauro Brunato, Ilias S. Kotsireas, and Panos M. Pardalos, editors. Learning and Intelligent Optimization - 12th International Conference, LION 12, Kalamata, Greece, June 10-15, 2018, Revised Selected Papers, volume 11353. Springer, 2019. [ http ]
@proceedings{DBLP:conf/lion/2018,
 doi = {10.1007/978-3-030-05348-2},
 editor = {Roberto Battiti and
Mauro Brunato and
Ilias S. Kotsireas and
Panos M. Pardalos},
 publisher = {Springer},
 title = {Learning and Intelligent Optimization - 12th International Conference,
{LION} 12, Kalamata, Greece, June 10-15, 2018, Revised Selected Papers},
 url = {https://doi.org/10.1007/978-3-030-05348-2},
 volume = {11353},
 year = {2019}
}
[ 76 ]
Ilias S. Kotsireas, Panos M. Pardalos, Konstantinos E. Parsopoulos, Dimitris Souravlias, and Arsenis Tsokas, editors. Analysis of Experimental Algorithms - Special Event, SEA^2 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers, volume 11544. Springer, 2019. [ http ]
@proceedings{DBLP:conf/sea2/2019,
 doi = {10.1007/978-3-030-34029-2},
 editor = {Ilias S. Kotsireas and
Panos M. Pardalos and
Konstantinos E. Parsopoulos and
Dimitris Souravlias and
Arsenis Tsokas},
 publisher = {Springer},
 title = {Analysis of Experimental Algorithms - Special Event, SEA{\({^2}\)}
2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers},
 url = {https://doi.org/10.1007/978-3-030-34029-2},
 volume = {11544},
 year = {2019}
}


[ 2018 ]


[ 75 ]
Curtis Bright, Ilias S. Kotsireas, and Vijay Ganesh. The SAT+CAS paradigm and the williamson conjecture. ACM Commun. Comput. Algebra, 52:82--84, 2018. [ http ]
@article{DBLP:journals/cca/BrightKG18,
 author = {Curtis Bright and
Ilias S. Kotsireas and
Vijay Ganesh},
 doi = {10.1145/3313880.3313889},
 journal = {{ACM} Commun. Comput. Algebra},
 pages = {82--84},
 title = {The {SAT+CAS} paradigm and the Williamson conjecture},
 url = {https://doi.org/10.1145/3313880.3313889},
 volume = {52},
 year = {2018}
}
[ 74 ]
Curtis Bright, Ilias S. Kotsireas, and Vijay Ganesh. Applying computer algebra systems and SAT solvers to the williamson conjecture. CoRR, abs/1804.01172, 2018. [ http ]
@article{DBLP:journals/corr/abs-1804-01172,
 author = {Curtis Bright and
Ilias S. Kotsireas and
Vijay Ganesh},
 journal = {CoRR},
 title = {Applying Computer Algebra Systems and {SAT} Solvers to the Williamson
Conjecture},
 url = {http://arxiv.org/abs/1804.01172},
 volume = {abs/1804.01172},
 year = {2018}
}
[ 73 ]
Francisco J. Aragón Artacho, Rubén Campoy, Ilias S. Kotsireas, and Matthew K. Tam. A feasibility approach for constructing combinatorial designs of circulant type. J. Comb. Optim., 35:1061--1085, 2018. [ http ]
@article{DBLP:journals/jco/ArtachoCKT18,
 author = {Francisco J. Arag{\'{o}}n Artacho and
Rub{\'{e}}n Campoy and
Ilias S. Kotsireas and
Matthew K. Tam},
 doi = {10.1007/s10878-018-0250-5},
 journal = {J. Comb. Optim.},
 pages = {1061--1085},
 title = {A feasibility approach for constructing combinatorial designs of circulant
type},
 url = {https://doi.org/10.1007/s10878-018-0250-5},
 volume = {35},
 year = {2018}
}
[ 72 ]
Dragomir Z. Dokovic and Ilias S. Kotsireas. Goethals-seidel difference families with symmetric or skew base blocks. Math. Comput. Sci., 12:373--388, 2018. [ http ]
@article{DBLP:journals/mics/DokovicK18,
 author = {Dragomir Z. Dokovic and
Ilias S. Kotsireas},
 doi = {10.1007/s11786-018-0381-1},
 journal = {Math. Comput. Sci.},
 pages = {373--388},
 title = {Goethals-Seidel Difference Families with Symmetric or Skew Base Blocks},
 url = {https://doi.org/10.1007/s11786-018-0381-1},
 volume = {12},
 year = {2018}
}
[ 71 ]
Dardo Goyeneche, Ilias S. Kotsireas, and Padraig Ó Catháin. Foreword. Math. Comput. Sci., 12:371--372, 2018. [ http ]
@article{DBLP:journals/mics/GoyenecheKC18,
 author = {Dardo Goyeneche and
Ilias S. Kotsireas and
Padraig {\'{O}} Cath{\'{a}}in},
 doi = {10.1007/s11786-018-0388-7},
 journal = {Math. Comput. Sci.},
 pages = {371--372},
 title = {Foreword},
 url = {https://doi.org/10.1007/s11786-018-0388-7},
 volume = {12},
 year = {2018}
}
[ 70 ]
Curtis Bright, Ilias S. Kotsireas, and Vijay Ganesh. A SAT+CAS method for enumerating williamson matrices of even order. In Sheila A. McIlraith and Kilian Q. Weinberger, editors, Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, February 2-7, 2018, pages 6573--6580. AAAI Press, 2018. [ http ]
@inproceedings{DBLP:conf/aaai/BrightKG18,
 author = {Curtis Bright and
Ilias S. Kotsireas and
Vijay Ganesh},
 booktitle = {Proceedings of the Thirty-Second {AAAI} Conference on Artificial Intelligence,
(AAAI-18), the 30th innovative Applications of Artificial Intelligence
(IAAI-18), and the 8th {AAAI} Symposium on Educational Advances in
Artificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, February
2-7, 2018},
 editor = {Sheila A. McIlraith and
Kilian Q. Weinberger},
 pages = {6573--6580},
 publisher = {{AAAI} Press},
 title = {A {SAT+CAS} Method for Enumerating Williamson Matrices of Even Order},
 url = {https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/view/16625},
 year = {2018}
}
[ 69 ]
Ilias S. Kotsireas and Jing Yang. Autocorrelation via runs. In Jacques D. Fleuriot, Dongming Wang, and Jacques Calmet, editors, Artificial Intelligence and Symbolic Computation - 13th International Conference, AISC 2018, Suzhou, China, September 16-19, 2018, Proceedings, volume 11110, pages 195--205. Springer, 2018. [ http ]
@inproceedings{DBLP:conf/aisc/KotsireasY18,
 author = {Ilias S. Kotsireas and
Jing Yang},
 booktitle = {Artificial Intelligence and Symbolic Computation - 13th International
Conference, {AISC} 2018, Suzhou, China, September 16-19, 2018, Proceedings},
 doi = {10.1007/978-3-319-99957-9_13},
 editor = {Jacques D. Fleuriot and
Dongming Wang and
Jacques Calmet},
 pages = {195--205},
 publisher = {Springer},
 title = {Autocorrelation via Runs},
 url = {https://doi.org/10.1007/978-3-319-99957-9_13},
 volume = {11110},
 year = {2018}
}
[ 68 ]
Curtis Bright, Ilias S. Kotsireas, Albert Heinle, and Vijay Ganesh. Enumeration of complex golay pairs via programmatic SAT. In Manuel Kauers, Alexey Ovchinnikov, and Éric Schost, editors, Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2018, New York, NY, USA, July 16-19, 2018, pages 111--118. ACM, 2018. [ http ]
@inproceedings{DBLP:conf/issac/BrightKHG18,
 author = {Curtis Bright and
Ilias S. Kotsireas and
Albert Heinle and
Vijay Ganesh},
 booktitle = {Proceedings of the 2018 {ACM} on International Symposium on Symbolic
and Algebraic Computation, {ISSAC} 2018, New York, NY, USA, July 16-19,
2018},
 doi = {10.1145/3208976.3209006},
 editor = {Manuel Kauers and
Alexey Ovchinnikov and
{\'{E}}ric Schost},
 pages = {111--118},
 publisher = {{ACM}},
 title = {Enumeration of Complex Golay Pairs via Programmatic {SAT}},
 url = {https://doi.org/10.1145/3208976.3209006},
 year = {2018}
}
[ 67 ]
Kristoffer Kleine, Ilias S. Kotsireas, and Dimitris E. Simos. Evaluation of tie-breaking and parameter ordering for the IPO family of algorithms used in covering array generation. In Costas S. Iliopoulos, Hon Wai Leong, and Wing-Kin Sung, editors, Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018, Proceedings, volume 10979, pages 189--200. Springer, 2018. [ http ]
@inproceedings{DBLP:conf/iwoca/KleineKS18,
 author = {Kristoffer Kleine and
Ilias S. Kotsireas and
Dimitris E. Simos},
 booktitle = {Combinatorial Algorithms - 29th International Workshop, {IWOCA} 2018,
Singapore, July 16-19, 2018, Proceedings},
 doi = {10.1007/978-3-319-94667-2_16},
 editor = {Costas S. Iliopoulos and
Hon Wai Leong and
Wing{-}Kin Sung},
 pages = {189--200},
 publisher = {Springer},
 title = {Evaluation of Tie-Breaking and Parameter Ordering for the {IPO} Family
of Algorithms Used in Covering Array Generation},
 url = {https://doi.org/10.1007/978-3-319-94667-2_16},
 volume = {10979},
 year = {2018}
}


[ 2017 ]


[ 66 ]
Edward Zulkoski, Curtis Bright, Albert Heinle, Ilias S. Kotsireas, Krzysztof Czarnecki, and Vijay Ganesh. Combining SAT solvers with computer algebra systems to verify combinatorial conjectures. J. Autom. Reason., 58:313--339, 2017. [ http ]
@article{DBLP:journals/jar/ZulkoskiBHKCG17,
 author = {Edward Zulkoski and
Curtis Bright and
Albert Heinle and
Ilias S. Kotsireas and
Krzysztof Czarnecki and
Vijay Ganesh},
 doi = {10.1007/s10817-016-9396-y},
 journal = {J. Autom. Reason.},
 pages = {313--339},
 title = {Combining {SAT} Solvers with Computer Algebra Systems to Verify Combinatorial
Conjectures},
 url = {https://doi.org/10.1007/s10817-016-9396-y},
 volume = {58},
 year = {2017}
}
[ 65 ]
Thierry N. Dana-Picard, Wolfram Koepf, Ilias S. Kotsireas, Zoltán Kovács, Alexander N. Prokopenya, and Werner M. Seiler. Foreword. Math. Comput. Sci., 11:251--252, 2017. [ http ]
@article{DBLP:journals/mics/Dana-PicardKKKP17,
 author = {Thierry N. Dana{-}Picard and
Wolfram Koepf and
Ilias S. Kotsireas and
Zolt{\'{a}}n Kov{\'{a}}cs and
Alexander N. Prokopenya and
Werner M. Seiler},
 doi = {10.1007/s11786-017-0324-2},
 journal = {Math. Comput. Sci.},
 pages = {251--252},
 title = {Foreword},
 url = {https://doi.org/10.1007/s11786-017-0324-2},
 volume = {11},
 year = {2017}
}
[ 64 ]
Ilias S. Kotsireas. Mathematics in computer science: After 10 years. Math. Comput. Sci., 11:1--6, 2017. [ http ]
@article{DBLP:journals/mics/Kotsireas17,
 author = {Ilias S. Kotsireas},
 doi = {10.1007/s11786-017-0312-6},
 journal = {Math. Comput. Sci.},
 pages = {1--6},
 title = {Mathematics in Computer Science: After 10 Years},
 url = {https://doi.org/10.1007/s11786-017-0312-6},
 volume = {11},
 year = {2017}
}
[ 63 ]
Ioannis Z. Emiris, Christos Konaxis, Ilias S. Kotsireas, and Clément Laroche. Matrix representations by means of interpolation. In Michael A. Burr, Chee K. Yap, and Mohab Safey El Din, editors, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017, pages 149--156. ACM, 2017. [ http ]
@inproceedings{DBLP:conf/issac/EmirisKKL17,
 author = {Ioannis Z. Emiris and
Christos Konaxis and
Ilias S. Kotsireas and
Cl{\'{e}}ment Laroche},
 booktitle = {Proceedings of the 2017 {ACM} on International Symposium on Symbolic
and Algebraic Computation, {ISSAC} 2017, Kaiserslautern, Germany,
July 25-28, 2017},
 doi = {10.1145/3087604.3087629},
 editor = {Michael A. Burr and
Chee K. Yap and
Mohab Safey El Din},
 pages = {149--156},
 publisher = {{ACM}},
 title = {Matrix Representations by Means of Interpolation},
 url = {https://doi.org/10.1145/3087604.3087629},
 year = {2017}
}
[ 62 ]
Johannes Blömer, Ilias S. Kotsireas, Temur Kutsia, and Dimitris E. Simos, editors. Mathematical Aspects of Computer and Information Sciences - 7th International Conference, MACIS 2017, Vienna, Austria, November 15-17, 2017, Proceedings, volume 10693. Springer, 2017. [ http ]
@proceedings{DBLP:conf/macis/2017,
 doi = {10.1007/978-3-319-72453-9},
 editor = {Johannes Bl{\"{o}}mer and
Ilias S. Kotsireas and
Temur Kutsia and
Dimitris E. Simos},
 publisher = {Springer},
 title = {Mathematical Aspects of Computer and Information Sciences - 7th International
Conference, {MACIS} 2017, Vienna, Austria, November 15-17, 2017, Proceedings},
 url = {https://doi.org/10.1007/978-3-319-72453-9},
 volume = {10693},
 year = {2017}
}


[ 2016 ]


[ 61 ]
Srinivasan Arunachalam and Ilias S. Kotsireas. Hard satisfiable 3-sat instances via autocorrelation. J. Satisf. Boolean Model. Comput., 10:11--22, 2016. [ http ]
@article{DBLP:journals/jsat/ArunachalamK16,
 author = {Srinivasan Arunachalam and
Ilias S. Kotsireas},
 doi = {10.3233/sat190111},
 journal = {J. Satisf. Boolean Model. Comput.},
 pages = {11--22},
 title = {Hard satisfiable 3-SAT instances via autocorrelation},
 url = {https://doi.org/10.3233/sat190111},
 volume = {10},
 year = {2016}
}
[ 60 ]
Dimitris Souravlias, Konstantinos E. Parsopoulos, and Ilias S. Kotsireas. Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics. Optim. Lett., 10:1303--1314, 2016. [ http ]
@article{DBLP:journals/ol/SouravliasPK16,
 author = {Dimitris Souravlias and
Konstantinos E. Parsopoulos and
Ilias S. Kotsireas},
 doi = {10.1007/s11590-015-0927-y},
 journal = {Optim. Lett.},
 pages = {1303--1314},
 title = {Circulant weighing matrices: a demanding challenge for parallel optimization
metaheuristics},
 url = {https://doi.org/10.1007/s11590-015-0927-y},
 volume = {10},
 year = {2016}
}
[ 59 ]
Curtis Bright, Vijay Ganesh, Albert Heinle, Ilias S. Kotsireas, Saeed Nejati, and Krzysztof Czarnecki. Mathcheck2: A SAT+CAS verifier for combinatorial conjectures. In Vladimir P. Gerdt, Wolfram Koepf, Werner M. Seiler, and Evgenii V. Vorozhtsov, editors, Computer Algebra in Scientific Computing - 18th International Workshop, CASC 2016, Bucharest, Romania, September 19-23, 2016, Proceedings, volume 9890, pages 117--133. Springer, 2016. [ http ]
@inproceedings{DBLP:conf/casc/BrightGHKNC16,
 author = {Curtis Bright and
Vijay Ganesh and
Albert Heinle and
Ilias S. Kotsireas and
Saeed Nejati and
Krzysztof Czarnecki},
 booktitle = {Computer Algebra in Scientific Computing - 18th International Workshop,
{CASC} 2016, Bucharest, Romania, September 19-23, 2016, Proceedings},
 doi = {10.1007/978-3-319-45641-6_9},
 editor = {Vladimir P. Gerdt and
Wolfram Koepf and
Werner M. Seiler and
Evgenii V. Vorozhtsov},
 pages = {117--133},
 publisher = {Springer},
 title = {MathCheck2: {A} {SAT+CAS} Verifier for Combinatorial Conjectures},
 url = {https://doi.org/10.1007/978-3-319-45641-6_9},
 volume = {9890},
 year = {2016}
}
[ 58 ]
Ilias S. Kotsireas. Computational approaches to open problems in combinatorics. In International Symposium on Artificial Intelligence and Mathematics, ISAIM 2016, Fort Lauderdale, Florida, USA, January 4-6, 2016, 2016. [ .pdf ]
@inproceedings{DBLP:conf/isaim/Kotsireas16,
 author = {Ilias S. Kotsireas},
 booktitle = {International Symposium on Artificial Intelligence and Mathematics,
{ISAIM} 2016, Fort Lauderdale, Florida, USA, January 4-6, 2016},
 title = {Computational Approaches to Open Problems in Combinatorics},
 url = {http://isaim2016.cs.virginia.edu/papers/ISAIM2016_Proofs_Kotsireas.pdf},
 year = {2016}
}
[ 57 ]
Curtis Bright, Vijay Ganesh, Albert Heinle, Ilias S. Kotsireas, Saeed Nejati, and Krzysztof Czarnecki. Mathcheck2: A SAT+CAS verifier for combinatorial conjectures. In Erika Ábrahám, James H. Davenport, and Pascal Fontaine, editors, Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic Computation co-located with 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2016), Timisoara, Romania, September 24, 2016, volume 1804, pages 13--19. CEUR-WS.org, 2016. [ .pdf ]
@inproceedings{DBLP:conf/synasc/BrightGHKNC16,
 author = {Curtis Bright and
Vijay Ganesh and
Albert Heinle and
Ilias S. Kotsireas and
Saeed Nejati and
Krzysztof Czarnecki},
 booktitle = {Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic
Computation co-located with 18th International Symposium on Symbolic
and Numeric Algorithms for Scientific Computing {(SYNASC} 2016), Timisoara,
Romania, September 24, 2016},
 editor = {Erika {\'{A}}brah{\'{a}}m and
James H. Davenport and
Pascal Fontaine},
 pages = {13--19},
 publisher = {CEUR-WS.org},
 title = {MathCheck2: {A} {SAT+CAS} Verifier for Combinatorial Conjectures},
 url = {http://ceur-ws.org/Vol-1804/paper-04.pdf},
 volume = {1804},
 year = {2016}
}
[ 56 ]
Ilias S. Kotsireas, Panos M. Pardalos, Konstantinos E. Parsopoulos, and Dimitris Souravlias. On the solution of circulant weighing matrices problems using algorithm portfolios on multi-core processors. In Andrew V. Goldberg and Alexander S. Kulikov, editors, Experimental Algorithms - 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings, volume 9685, pages 184--200. Springer, 2016. [ http ]
@inproceedings{DBLP:conf/wea/KotsireasPPS16,
 author = {Ilias S. Kotsireas and
Panos M. Pardalos and
Konstantinos E. Parsopoulos and
Dimitris Souravlias},
 booktitle = {Experimental Algorithms - 15th International Symposium, {SEA} 2016,
St. Petersburg, Russia, June 5-8, 2016, Proceedings},
 doi = {10.1007/978-3-319-38851-9_13},
 editor = {Andrew V. Goldberg and
Alexander S. Kulikov},
 pages = {184--200},
 publisher = {Springer},
 title = {On the Solution of Circulant Weighing Matrices Problems Using Algorithm
Portfolios on Multi-core Processors},
 url = {https://doi.org/10.1007/978-3-319-38851-9_13},
 volume = {9685},
 year = {2016}
}
[ 55 ]
Ilias S. Kotsireas, Siegfried M. Rump, and Chee K. Yap, editors. Mathematical Aspects of Computer and Information Sciences - 6th International Conference, MACIS 2015, Berlin, Germany, November 11-13, 2015, Revised Selected Papers, volume 9582. Springer, 2016. [ http ]
@proceedings{DBLP:conf/macis/2015,
 doi = {10.1007/978-3-319-32859-1},
 editor = {Ilias S. Kotsireas and
Siegfried M. Rump and
Chee K. Yap},
 publisher = {Springer},
 title = {Mathematical Aspects of Computer and Information Sciences - 6th International
Conference, {MACIS} 2015, Berlin, Germany, November 11-13, 2015, Revised
Selected Papers},
 url = {https://doi.org/10.1007/978-3-319-32859-1},
 volume = {9582},
 year = {2016}
}


[ 2015 ]


[ 54 ]
Dragomir Z. Dokovic, Ilias S. Kotsireas, Daniel Recoskie, and Joe Sawada. Charm bracelets and their application to the construction of periodic golay pairs. Discret. Appl. Math., 188:32--40, 2015. [ http ]
@article{DBLP:journals/dam/DokovicKRS15,
 author = {Dragomir Z. Dokovic and
Ilias S. Kotsireas and
Daniel Recoskie and
Joe Sawada},
 doi = {10.1016/j.dam.2015.03.001},
 journal = {Discret. Appl. Math.},
 pages = {32--40},
 title = {Charm bracelets and their application to the construction of periodic
Golay pairs},
 url = {https://doi.org/10.1016/j.dam.2015.03.001},
 volume = {188},
 year = {2015}
}
[ 53 ]
Dragomir Z. Dokovic and Ilias S. Kotsireas. Compression of periodic complementary sequences and applications. Des. Codes Cryptogr., 74:365--377, 2015. [ http ]
@article{DBLP:journals/dcc/DokovicK15,
 author = {Dragomir Z. Dokovic and
Ilias S. Kotsireas},
 doi = {10.1007/s10623-013-9862-z},
 journal = {Des. Codes Cryptogr.},
 pages = {365--377},
 title = {Compression of periodic complementary sequences and applications},
 url = {https://doi.org/10.1007/s10623-013-9862-z},
 volume = {74},
 year = {2015}
}
[ 52 ]
Ilias S. Kotsireas and Edgar Martínez-Moro. Foreword: Computer algebra in coding theory and cryptography. Des. Codes Cryptogr., 76:1--2, 2015. [ http ]
@article{DBLP:journals/dcc/KotsireasM15,
 author = {Ilias S. Kotsireas and
Edgar Mart{\'{\i}}nez{-}Moro},
 doi = {10.1007/s10623-015-0041-2},
 journal = {Des. Codes Cryptogr.},
 pages = {1--2},
 title = {Foreword: Computer Algebra in Coding Theory and Cryptography},
 url = {https://doi.org/10.1007/s10623-015-0041-2},
 volume = {76},
 year = {2015}
}
[ 51 ]
Dragomir Z. Dokovic and Ilias S. Kotsireas. Some new periodic golay pairs. Numer. Algorithms, 69:523--530, 2015. [ http ]
@article{DBLP:journals/na/DokovicK15,
 author = {Dragomir Z. Dokovic and
Ilias S. Kotsireas},
 doi = {10.1007/s11075-014-9910-4},
 journal = {Numer. Algorithms},
 pages = {523--530},
 title = {Some new periodic Golay pairs},
 url = {https://doi.org/10.1007/s11075-014-9910-4},
 volume = {69},
 year = {2015}
}
[ 50 ]
Ilias S. Kotsireas, Temur Kutsia, and Dimitris E. Simos. Constructing orthogonal designs in powers of two: Gröbner bases meet equational unification. In Maribel Fernández, editor, 26th International Conference on Rewriting Techniques and Applications, RTA 2015, June 29 to July 1, 2015, Warsaw, Poland, volume 36, pages 241--256. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. [ http ]
@inproceedings{DBLP:conf/rta/KotsireasKS15,
 author = {Ilias S. Kotsireas and
Temur Kutsia and
Dimitris E. Simos},
 booktitle = {26th International Conference on Rewriting Techniques and Applications,
{RTA} 2015, June 29 to July 1, 2015, Warsaw, Poland},
 doi = {10.4230/LIPIcs.RTA.2015.241},
 editor = {Maribel Fern{\'{a}}ndez},
 pages = {241--256},
 publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
 title = {Constructing Orthogonal Designs in Powers of Two: Gr{\"{o}}bner Bases
Meet Equational Unification},
 url = {https://doi.org/10.4230/LIPIcs.RTA.2015.241},
 volume = {36},
 year = {2015}
}


[ 2014 ]


[ 49 ]
Ilias S. Kotsireas. Message from the SIGSAM chair. ACM Commun. Comput. Algebra, 48:154, 2014. [ http ]
@article{DBLP:journals/cca/Kotsireas14a,
 author = {Ilias S. Kotsireas},
 doi = {10.1145/2733693.2733718},
 journal = {{ACM} Commun. Comput. Algebra},
 pages = {154},
 title = {Message from the {SIGSAM} Chair},
 url = {https://doi.org/10.1145/2733693.2733718},
 volume = {48},
 year = {2014}
}
[ 48 ]
Ilias S. Kotsireas. Message from the SIGSAM chair. ACM Commun. Comput. Algebra, 48:32, 2014. [ http ]
@article{DBLP:journals/cca/Kotsireas14,
 author = {Ilias S. Kotsireas},
 doi = {10.1145/2644288.2644296},
 journal = {{ACM} Commun. Comput. Algebra},
 pages = {32},
 title = {Message from the {SIGSAM} Chair},
 url = {https://doi.org/10.1145/2644288.2644296},
 volume = {48},
 year = {2014}
}
[ 47 ]
Ilias S. Kotsireas, Lilia Krivodonova, Sabine McConnell, and Erik Schnetter. High performance computing theory and applications - proceedings of SHARCNET research day 2012 (guelph, ontario). J. Comput. Sci., 5:497--498, 2014. [ http ]
@article{DBLP:journals/jocs/KotsireasKMS14,
 author = {Ilias S. Kotsireas and
Lilia Krivodonova and
Sabine McConnell and
Erik Schnetter},
 doi = {10.1016/j.jocs.2014.04.009},
 journal = {J. Comput. Sci.},
 pages = {497--498},
 title = {High performance computing theory and applications - Proceedings of
{SHARCNET} Research Day 2012 (Guelph, Ontario)},
 url = {https://doi.org/10.1016/j.jocs.2014.04.009},
 volume = {5},
 year = {2014}
}
[ 46 ]
Ilias S. Kotsireas and Panos M. Pardalos. A new existence condition for hadamard matrices with circulant core. In Panos M. Pardalos, Mauricio G. C. Resende, Chrysafis Vogiatzis, and Jose L. Walteros, editors, Learning and Intelligent Optimization - 8th International Conference, Lion 8, Gainesville, FL, USA, February 16-21, 2014. Revised Selected Papers, volume 8426, pages 383--390. Springer, 2014. [ http ]
@inproceedings{DBLP:conf/lion/KotsireasP14,
 author = {Ilias S. Kotsireas and
Panos M. Pardalos},
 booktitle = {Learning and Intelligent Optimization - 8th International Conference,
Lion 8, Gainesville, FL, USA, February 16-21, 2014. Revised Selected
Papers},
 doi = {10.1007/978-3-319-09584-4_33},
 editor = {Panos M. Pardalos and
Mauricio G. C. Resende and
Chrysafis Vogiatzis and
Jose L. Walteros},
 pages = {383--390},
 publisher = {Springer},
 title = {A New Existence Condition for Hadamard Matrices with Circulant Core},
 url = {https://doi.org/10.1007/978-3-319-09584-4_33},
 volume = {8426},
 year = {2014}
}


[ 2013 ]


[ 45 ]
Ilias S. Kotsireas and Panos M. Pardalos. D-optimal matrices via quadratic integer optimization. J. Heuristics, 19:617--627, 2013. [ http ]
@article{DBLP:journals/heuristics/KotsireasP13,
 author = {Ilias S. Kotsireas and
Panos M. Pardalos},
 doi = {10.1007/s10732-011-9173-3},
 journal = {J. Heuristics},
 pages = {617--627},
 title = {D-optimal matrices via quadratic integer optimization},
 url = {https://doi.org/10.1007/s10732-011-9173-3},
 volume = {19},
 year = {2013}
}
[ 44 ]
Allen M. Tesdall, Jae-Hun Jung, Ilias S. Kotsireas, and Roderick V. N. Melnik. Preface. J. Comput. Sci., 4:1--2, 2013. [ http ]
@article{DBLP:journals/jocs/TesdallJKM13,
 author = {Allen M. Tesdall and
Jae{-}Hun Jung and
Ilias S. Kotsireas and
Roderick V. N. Melnik},
 doi = {10.1016/j.jocs.2012.10.002},
 journal = {J. Comput. Sci.},
 pages = {1--2},
 title = {Preface},
 url = {https://doi.org/10.1016/j.jocs.2012.10.002},
 volume = {4},
 year = {2013}
}
[ 43 ]
Ilias S. Kotsireas, Bernard Mourrain, Victor Y. Pan, and Lihong Zhi. Preface. Theor. Comput. Sci., 479:1--3, 2013. [ http ]
@article{DBLP:journals/tcs/KotsireasMPZ13,
 author = {Ilias S. Kotsireas and
Bernard Mourrain and
Victor Y. Pan and
Lihong Zhi},
 doi = {10.1016/j.tcs.2012.10.017},
 journal = {Theor. Comput. Sci.},
 pages = {1--3},
 title = {Preface},
 url = {https://doi.org/10.1016/j.tcs.2012.10.017},
 volume = {479},
 year = {2013}
}
[ 42 ]
Ilias S. Kotsireas. Structured hadamard conjecture. In Jonathan M. Borwein, Igor E. Shparlinski, and Wadim Zudilin, editors, Number Theory and Related Fields, In Memory of Alf van der Poorten, pages 215--227. Springer, 2013. [ http ]
@incollection{DBLP:books/daglib/p/Kotsireas13,
 author = {Ilias S. Kotsireas},
 booktitle = {Number Theory and Related Fields, In Memory of Alf van der Poorten},
 doi = {10.1007/978-1-4614-6642-0_11},
 editor = {Jonathan M. Borwein and
Igor E. Shparlinski and
Wadim Zudilin},
 pages = {215--227},
 publisher = {Springer},
 title = {Structured Hadamard Conjecture},
 url = {https://doi.org/10.1007/978-1-4614-6642-0_11},
 year = {2013}
}


[ 2012 ]


[ 41 ]
Ilias S. Kotsireas, Christos Koukouvinos, Panos M. Pardalos, and Dimitris E. Simos. Competent genetic algorithms for weighing matrices. J. Comb. Optim., 24:508--525, 2012. [ http ]
@article{DBLP:journals/jco/KotsireasKPS12,
 author = {Ilias S. Kotsireas and
Christos Koukouvinos and
Panos M. Pardalos and
Dimitris E. Simos},
 doi = {10.1007/s10878-011-9404-4},
 journal = {J. Comb. Optim.},
 pages = {508--525},
 title = {Competent genetic algorithms for weighing matrices},
 url = {https://doi.org/10.1007/s10878-011-9404-4},
 volume = {24},
 year = {2012}
}
[ 40 ]
Ilias S. Kotsireas, Irene Marquez Corbella, and Edgar Martínez-Moro. Foreword. Math. Comput. Sci., 6:107--108, 2012. [ http ]
@article{DBLP:journals/mics/KotsireasCM12,
 author = {Ilias S. Kotsireas and
Irene Marquez Corbella and
Edgar Mart{\'{\i}}nez{-}Moro},
 doi = {10.1007/s11786-012-0116-7},
 journal = {Math. Comput. Sci.},
 pages = {107--108},
 title = {Foreword},
 url = {https://doi.org/10.1007/s11786-012-0116-7},
 volume = {6},
 year = {2012}
}
[ 39 ]
Ilias S. Kotsireas, Christos Koukouvinos, and Jennifer Seberry. New weighing matrices constructed from two circulant submatrices. Optim. Lett., 6:211--217, 2012. [ http ]
@article{DBLP:journals/ol/KotsireasKS12,
 author = {Ilias S. Kotsireas and
Christos Koukouvinos and
Jennifer Seberry},
 doi = {10.1007/s11590-010-0264-0},
 journal = {Optim. Lett.},
 pages = {211--217},
 title = {New weighing matrices constructed from two circulant submatrices},
 url = {https://doi.org/10.1007/s11590-010-0264-0},
 volume = {6},
 year = {2012}
}
[ 38 ]
Ilias S. Kotsireas, Konstantinos E. Parsopoulos, Grigoris S. Piperagkas, and Michael N. Vrahatis. Ant-based approaches for solving autocorrelation problems. In Marco Dorigo, Mauro Birattari, Christian Blum, Anders Lyhne Christensen, Andries P. Engelbrecht, Roderich Groß, and Thomas Stützle, editors, Swarm Intelligence - 8th International Conference, ANTS 2012, Brussels, Belgium, September 12-14, 2012. Proceedings, volume 7461, pages 220--227. Springer, 2012. [ http ]
@inproceedings{DBLP:conf/ants/KotsireasPPV12,
 author = {Ilias S. Kotsireas and
Konstantinos E. Parsopoulos and
Grigoris S. Piperagkas and
Michael N. Vrahatis},
 booktitle = {Swarm Intelligence - 8th International Conference, {ANTS} 2012, Brussels,
Belgium, September 12-14, 2012. Proceedings},
 doi = {10.1007/978-3-642-32650-9_21},
 editor = {Marco Dorigo and
Mauro Birattari and
Christian Blum and
Anders Lyhne Christensen and
Andries P. Engelbrecht and
Roderich Gro{\ss} and
Thomas St{\"{u}}tzle},
 pages = {220--227},
 publisher = {Springer},
 title = {Ant-Based Approaches for Solving Autocorrelation Problems},
 url = {https://doi.org/10.1007/978-3-642-32650-9_21},
 volume = {7461},
 year = {2012}
}


[ 2011 ]


[ 37 ]
Ilias S. Kotsireas and Eugene V. Zima. Abstracts of WWCA 2011 in honor of herb wilf's 80th birthday. ACM Commun. Comput. Algebra, 45:92--99, 2011. [ http ]
@article{DBLP:journals/cca/KotsireasZ11,
 author = {Ilias S. Kotsireas and
Eugene V. Zima},
 doi = {10.1145/2016567.2016576},
 journal = {{ACM} Commun. Comput. Algebra},
 pages = {92--99},
 title = {Abstracts of {WWCA} 2011 in honor of Herb Wilf's 80th birthday},
 url = {https://doi.org/10.1145/2016567.2016576},
 volume = {45},
 year = {2011}
}
[ 36 ]
Mujahid N. Syed, Ilias S. Kotsireas, and Panos M. Pardalos. D-optimal designs: A mathematical programming approach using cyclotomic cosets. Informatica, 22:577--587, 2011. [ http ]
@article{DBLP:journals/informaticaLT/SyedKP11,
 author = {Mujahid N. Syed and
Ilias S. Kotsireas and
Panos M. Pardalos},
 journal = {Informatica},
 pages = {577--587},
 title = {D-Optimal Designs: {A} Mathematical Programming Approach Using Cyclotomic
Cosets},
 url = {http://content.iospress.com/articles/informatica/inf22-4-07},
 volume = {22},
 year = {2011}
}
[ 35 ]
Ilias S. Kotsireas, Christos Koukouvinos, and Panos M. Pardalos. A modified power spectral density test applied to weighing matrices with small weight. J. Comb. Optim., 22:873--881, 2011. [ http ]
@article{DBLP:journals/jco/KotsireasKP11,
 author = {Ilias S. Kotsireas and
Christos Koukouvinos and
Panos M. Pardalos},
 doi = {10.1007/s10878-010-9335-5},
 journal = {J. Comb. Optim.},
 pages = {873--881},
 title = {A modified power spectral density test applied to weighing matrices
with small weight},
 url = {https://doi.org/10.1007/s10878-010-9335-5},
 volume = {22},
 year = {2011}
}
[ 34 ]
Elizabeth Arnold, Ilias S. Kotsireas, and Markus Rosenkranz. Bruno buchberger and the world of gröbner bases. J. Symb. Comput., 46:495--497, 2011. [ http ]
@article{DBLP:journals/jsc/ArnoldKR11,
 author = {Elizabeth Arnold and
Ilias S. Kotsireas and
Markus Rosenkranz},
 doi = {10.1016/j.jsc.2010.10.001},
 journal = {J. Symb. Comput.},
 pages = {495--497},
 title = {Bruno Buchberger and the world of Gr{\"{o}}bner bases},
 url = {https://doi.org/10.1016/j.jsc.2010.10.001},
 volume = {46},
 year = {2011}
}
[ 33 ]
Ilias S. Kotsireas, Bernard Mourrain, and Victor Y. Pan. Preface. Theor. Comput. Sci., 412:1443--1444, 2011. [ http ]
@article{DBLP:journals/tcs/KotsireasMP11,
 author = {Ilias S. Kotsireas and
Bernard Mourrain and
Victor Y. Pan},
 doi = {10.1016/j.tcs.2010.12.002},
 journal = {Theor. Comput. Sci.},
 pages = {1443--1444},
 title = {Preface},
 url = {https://doi.org/10.1016/j.tcs.2010.12.002},
 volume = {412},
 year = {2011}
}


[ 2010 ]


[ 32 ]
K. T. Arasu, Ilias S. Kotsireas, Christos Koukouvinos, and Jennifer Seberry. On circulant and two-circulant weighing matrices. Australas. J Comb., 48:43--52, 2010. [ .pdf ]
@article{DBLP:journals/ajc/ArasuKKS10,
 author = {K. T. Arasu and
Ilias S. Kotsireas and
Christos Koukouvinos and
Jennifer Seberry},
 journal = {Australas. {J} Comb.},
 pages = {43--52},
 title = {On circulant and two-circulant weighing matrices},
 url = {http://ajc.maths.uq.edu.au/pdf/48/ajc_v48_p043.pdf},
 volume = {48},
 year = {2010}
}
[ 31 ]
Ilias S. Kotsireas, Christos Koukouvinos, Jennifer Seberry, and Dimitris E. Simos. New classes of orthogonal designs constructed from complementary sequences with given spread. Australas. J Comb., 46:67--78, 2010. [ .pdf ]
@article{DBLP:journals/ajc/KotsireasKSS10,
 author = {Ilias S. Kotsireas and
Christos Koukouvinos and
Jennifer Seberry and
Dimitris E. Simos},
 journal = {Australas. {J} Comb.},
 pages = {67--78},
 title = {New classes of orthogonal designs constructed from complementary sequences
with given spread},
 url = {http://ajc.maths.uq.edu.au/pdf/46/ajc_v46_p067.pdf},
 volume = {46},
 year = {2010}
}
[ 30 ]
Ilias S. Kotsireas, Christos Koukouvinos, Panos M. Pardalos, and Oleg V. Shylo. Periodic complementary binary sequences and combinatorial optimization algorithms. J. Comb. Optim., 20:63--75, 2010. [ http ]
@article{DBLP:journals/jco/KotsireasKPS10,
 author = {Ilias S. Kotsireas and
Christos Koukouvinos and
Panos M. Pardalos and
Oleg V. Shylo},
 doi = {10.1007/s10878-008-9194-5},
 journal = {J. Comb. Optim.},
 pages = {63--75},
 title = {Periodic complementary binary sequences and Combinatorial Optimization
algorithms},
 url = {https://doi.org/10.1007/s10878-008-9194-5},
 volume = {20},
 year = {2010}
}
[ 29 ]
Ilias S. Kotsireas, Christos Koukouvinos, and Panos M. Pardalos. An efficient string sorting algorithm for weighing matrices of small weight. Optim. Lett., 4:29--36, 2010. [ http ]
@article{DBLP:journals/ol/KotsireasKP10,
 author = {Ilias S. Kotsireas and
Christos Koukouvinos and
Panos M. Pardalos},
 doi = {10.1007/s11590-009-0144-7},
 journal = {Optim. Lett.},
 pages = {29--36},
 title = {An efficient string sorting algorithm for weighing matrices of small
weight},
 url = {https://doi.org/10.1007/s11590-009-0144-7},
 volume = {4},
 year = {2010}
}


[ 2009 ]


[ 28 ]
Ilias S. Kotsireas, Christos Koukouvinos, and Dimitris E. Simos. MDS and near-mds self-dual codes over large prime fields. Adv. Math. Commun., 3:349--361, 2009. [ http ]
@article{DBLP:journals/amco/KotsireasKS09,
 author = {Ilias S. Kotsireas and
Christos Koukouvinos and
Dimitris E. Simos},
 doi = {10.3934/amc.2009.3.349},
 journal = {Adv. Math. Commun.},
 pages = {349--361},
 title = {{MDS} and near-MDS self-dual codes over large prime fields},
 url = {https://doi.org/10.3934/amc.2009.3.349},
 volume = {3},
 year = {2009}
}
[ 27 ]
Robert M. Corless, Karin Gatermann, and Ilias S. Kotsireas. Using symmetries in the eigenvalue method for polynomial systems. J. Symb. Comput., 44:1536--1550, 2009. [ http ]
@article{DBLP:journals/jsc/CorlessGK09,
 author = {Robert M. Corless and
Karin Gatermann and
Ilias S. Kotsireas},
 doi = {10.1016/j.jsc.2008.11.009},
 journal = {J. Symb. Comput.},
 pages = {1536--1550},
 title = {Using symmetries in the eigenvalue method for polynomial systems},
 url = {https://doi.org/10.1016/j.jsc.2008.11.009},
 volume = {44},
 year = {2009}
}
[ 26 ]
Ilias S. Kotsireas and Christos Koukouvinos. Hadamard matrices of williamson type: A challenge for computer algebra. J. Symb. Comput., 44:271--279, 2009. [ http ]
@article{DBLP:journals/jsc/KotsireasK09,
 author = {Ilias S. Kotsireas and
Christos Koukouvinos},
 doi = {10.1016/j.jsc.2007.05.004},
 journal = {J. Symb. Comput.},
 pages = {271--279},
 title = {Hadamard matrices of Williamson type: {A} challenge for Computer Algebra},
 url = {https://doi.org/10.1016/j.jsc.2007.05.004},
 volume = {44},
 year = {2009}
}
[ 25 ]
Hiroshi Kai, Hiroshi Sekigawa, Tateaki Sasaki, Kiyoshi Shirayanagi, and Ilias S. Kotsireas, editors. Symbolic Numeric Computation, SNC '09, Kyoto, Japan - August 03 - 05, 2009. ACM, 2009. [ http ]
@proceedings{DBLP:conf/snc/2009,
 editor = {Hiroshi Kai and
Hiroshi Sekigawa and
Tateaki Sasaki and
Kiyoshi Shirayanagi and
Ilias S. Kotsireas},
 publisher = {{ACM}},
 title = {Symbolic Numeric Computation, {SNC} '09, Kyoto, Japan - August 03
- 05, 2009},
 url = {http://dl.acm.org/citation.cfm?id=1577190},
 year = {2009}
}


[ 2008 ]


[ 24 ]
Ilias S. Kotsireas and Christos Koukouvinos. New skew-hadamard matrices via computational algebra. Australas. J Comb., 41:235--248, 2008. [ .pdf ]
@article{DBLP:journals/ajc/KotsireasK08,
 author = {Ilias S. Kotsireas and
Christos Koukouvinos},
 journal = {Australas. {J} Comb.},
 pages = {235--248},
 title = {New skew-Hadamard matrices via computational algebra},
 url = {http://ajc.maths.uq.edu.au/pdf/41/ajc_v41_p235.pdf},
 volume = {41},
 year = {2008}
}
[ 23 ]
Ilias S. Kotsireas, Christos Koukouvinos, and Jennifer Seberry. New orthogonal designs from weighing matrices. Australas. J Comb., 40:99--104, 2008. [ .pdf ]
@article{DBLP:journals/ajc/KotsireasKS08,
 author = {Ilias S. Kotsireas and
Christos Koukouvinos and
Jennifer Seberry},
 journal = {Australas. {J} Comb.},
 pages = {99--104},
 title = {New orthogonal designs from weighing matrices},
 url = {http://ajc.maths.uq.edu.au/pdf/40/ajc_v40_p099.pdf},
 volume = {40},
 year = {2008}
}
[ 22 ]
Ilias S. Kotsireas. Foreword. Math. Comput. Sci., 1:439, 2008. [ http ]
@article{DBLP:journals/mics/Kotsireas08,
 author = {Ilias S. Kotsireas},
 doi = {10.1007/s11786-008-0041-y},
 journal = {Math. Comput. Sci.},
 pages = {439},
 title = {Foreword},
 url = {https://doi.org/10.1007/s11786-008-0041-y},
 volume = {1},
 year = {2008}
}
[ 21 ]
Marco Chiarandini, Ilias S. Kotsireas, Christos Koukouvinos, and Luís Paquete. Heuristic algorithms for hadamard matrices with two circulant cores. Theor. Comput. Sci., 407:274--277, 2008. [ http ]
@article{DBLP:journals/tcs/ChiarandiniKKP08,
 author = {Marco Chiarandini and
Ilias S. Kotsireas and
Christos Koukouvinos and
Lu{\'{\i}}s Paquete},
 doi = {10.1016/j.tcs.2008.06.002},
 journal = {Theor. Comput. Sci.},
 pages = {274--277},
 title = {Heuristic algorithms for Hadamard matrices with two circulant cores},
 url = {https://doi.org/10.1016/j.tcs.2008.06.002},
 volume = {407},
 year = {2008}
}


[ 2007 ]


[ 20 ]
Ilias S. Kotsireas and Christos Koukouvinos. Orthogonal designs of order 32 and 64 via computational algebra. Australas. J Comb., 39:39--48, 2007. [ .pdf ]
@article{DBLP:journals/ajc/KotsireasK07,
 author = {Ilias S. Kotsireas and
Christos Koukouvinos},
 journal = {Australas. {J} Comb.},
 pages = {39--48},
 title = {Orthogonal designs of order 32 and 64 via computational algebra},
 url = {http://ajc.maths.uq.edu.au/pdf/39/ajc_v39_p039.pdf},
 volume = {39},
 year = {2007}
}
[ 19 ]
Mark Giesbrecht, Ilias S. Kotsireas, and Austin Lobo. ISSAC 2007 poster abstracts. ACM Commun. Comput. Algebra, 41:38--72, 2007. [ http ]
@article{DBLP:journals/cca/GiesbrechtKL07,
 author = {Mark Giesbrecht and
Ilias S. Kotsireas and
Austin Lobo},
 doi = {10.1145/1296772.1296775},
 journal = {{ACM} Commun. Comput. Algebra},
 pages = {38--72},
 title = {{ISSAC} 2007 poster abstracts},
 url = {https://doi.org/10.1145/1296772.1296775},
 volume = {41},
 year = {2007}
}
[ 18 ]
Ilias S. Kotsireas and Christos Koukouvinos. Inequivalent hadamard matrices from orthogonal designs. In Marc Moreno Maza and Stephen M. Watt, editors, Parallel Symbolic Computation, PASCO 2007, International Workshop, 27-28 July 2007, University of Western Ontario, London, Ontario, Canada, pages 95--96. ACM, 2007. [ http ]
@inproceedings{DBLP:conf/issac/KotsireasK07,
 author = {Ilias S. Kotsireas and
Christos Koukouvinos},
 booktitle = {Parallel Symbolic Computation, {PASCO} 2007, International Workshop,
27-28 July 2007, University of Western Ontario, London, Ontario, Canada},
 doi = {10.1145/1278177.1278194},
 editor = {Marc Moreno Maza and
Stephen M. Watt},
 pages = {95--96},
 publisher = {{ACM}},
 title = {Inequivalent Hadamard matrices from orthogonal designs},
 url = {https://doi.org/10.1145/1278177.1278194},
 year = {2007}
}


[ 2006 ]


[ 17 ]
Jason Cousineau, Ilias S. Kotsireas, and Christos Koukouvinos. Genetic algorithms for orthogonal designs. Australas. J Comb., 35:263--272, 2006. [ .pdf ]
@article{DBLP:journals/ajc/CousineauKK06,
 author = {Jason Cousineau and
Ilias S. Kotsireas and
Christos Koukouvinos},
 journal = {Australas. {J} Comb.},
 pages = {263--272},
 title = {Genetic algorithms for orthogonal designs},
 url = {http://ajc.maths.uq.edu.au/pdf/35/ajc_v35_p263.pdf},
 volume = {35},
 year = {2006}
}
[ 16 ]
Ilias S. Kotsireas and Eugene A. Zima. WWCA 2006 abstracts. ACM Commun. Comput. Algebra, 40:52--59, 2006. [ http ]
@article{DBLP:journals/cca/KotsireasZ06,
 author = {Ilias S. Kotsireas and
Eugene A. Zima},
 doi = {10.1145/1182553.1182565},
 journal = {{ACM} Commun. Comput. Algebra},
 pages = {52--59},
 title = {{WWCA} 2006 abstracts},
 url = {https://doi.org/10.1145/1182553.1182565},
 volume = {40},
 year = {2006}
}
[ 15 ]
Ilias S. Kotsireas, Christos Koukouvinos, and Jennifer Seberry. Hadamard ideals and hadamard matrices with two circulant cores. Eur. J. Comb., 27:658--668, 2006. [ http ]
@article{DBLP:journals/ejc/KotsireasKS06,
 author = {Ilias S. Kotsireas and
Christos Koukouvinos and
Jennifer Seberry},
 doi = {10.1016/j.ejc.2005.03.004},
 journal = {Eur. J. Comb.},
 pages = {658--668},
 title = {Hadamard ideals and Hadamard matrices with two circulant cores},
 url = {https://doi.org/10.1016/j.ejc.2005.03.004},
 volume = {27},
 year = {2006}
}
[ 14 ]
Konstantinos Karamanos and Ilias S. Kotsireas. Addendum: On the statistical analysis of the first digits of the feigenbaum constants. J. Frankl. Inst., 343:759--761, 2006. [ http ]
@article{DBLP:journals/jfi/KaramanosK06,
 author = {Konstantinos Karamanos and
Ilias S. Kotsireas},
 doi = {10.1016/j.jfranklin.2006.06.002},
 journal = {J. Frankl. Inst.},
 pages = {759--761},
 title = {Addendum: On the statistical analysis of the first digits of the Feigenbaum
constants},
 url = {https://doi.org/10.1016/j.jfranklin.2006.06.002},
 volume = {343},
 year = {2006}
}


[ 2005 ]


[ 13 ]
Konstantinos Karamanos and Ilias S. Kotsireas. Statistical analysis of the first digits of the binary expansion of feigenbaum constants α and δ. J. Frankl. Inst., 342:329--340, 2005. [ http ]
@article{DBLP:journals/jfi/KaramanosK05,
 author = {Konstantinos Karamanos and
Ilias S. Kotsireas},
 doi = {10.1016/j.jfranklin.2004.11.004},
 journal = {J. Frankl. Inst.},
 pages = {329--340},
 title = {Statistical analysis of the first digits of the binary expansion of
Feigenbaum constants {\(\alpha\)} and {\(\delta\)}},
 url = {https://doi.org/10.1016/j.jfranklin.2004.11.004},
 volume = {342},
 year = {2005}
}
[ 12 ]
Ilias S. Kotsireas, Alkiviadis G. Akritas, Stanly L. Steinberg, and Michael J. Wester. Foreword to the special issue on applications of computer algebra. J. Symb. Comput., 40:1129--1130, 2005. [ http ]
@article{DBLP:journals/jsc/KotsireasASW05,
 author = {Ilias S. Kotsireas and
Alkiviadis G. Akritas and
Stanly L. Steinberg and
Michael J. Wester},
 doi = {10.1016/j.jsc.2002.04.001},
 journal = {J. Symb. Comput.},
 pages = {1129--1130},
 title = {Foreword to the special issue on Applications of computer algebra},
 url = {https://doi.org/10.1016/j.jsc.2002.04.001},
 volume = {40},
 year = {2005}
}
[ 11 ]
Ilias S. Kotsireas and Gil Pinheiro. A meta-software system for the discovery of hadamard matrices. In 19th Annual International Symposium on High Performance Computing Systems and Applications (HPCS 2005), 15-18 May 2005, Guelph, Ontario, Canada, pages 17--23. IEEE Computer Society, 2005. [ http ]
@inproceedings{DBLP:conf/hpcs/KotsireasP05,
 author = {Ilias S. Kotsireas and
Gil Pinheiro},
 booktitle = {19th Annual International Symposium on High Performance Computing
Systems and Applications {(HPCS} 2005), 15-18 May 2005, Guelph, Ontario,
Canada},
 doi = {10.1109/HPCS.2005.9},
 pages = {17--23},
 publisher = {{IEEE} Computer Society},
 title = {A Meta-Software System for the Discovery of Hadamard Matrices},
 url = {https://doi.org/10.1109/HPCS.2005.9},
 year = {2005}
}


[ 2004 ]


[ 10 ]
Ilias S. Kotsireas and Emil J. Volcheck. ANTS VI: algorithmic number theory symposium poster abstracts. SIGSAM Bull., 38:93--107, 2004. [ http ]
@article{DBLP:journals/cca/KotsireasV04,
 author = {Ilias S. Kotsireas and
Emil J. Volcheck},
 doi = {10.1145/1040034.1040041},
 journal = {{SIGSAM} Bull.},
 pages = {93--107},
 title = {{ANTS} {VI:} algorithmic number theory symposium poster abstracts},
 url = {https://doi.org/10.1145/1040034.1040041},
 volume = {38},
 year = {2004}
}
[ 9 ]
Ilias S. Kotsireas and Kostas Karamanos. Exact computation of the bifurcation point b_4 of the logistic map and the bailey-broadhurst conjectures. Int. J. Bifurc. Chaos, 14:2417--2423, 2004. [ http ]
@article{DBLP:journals/ijbc/KotsireasK04,
 author = {Ilias S. Kotsireas and
Kostas Karamanos},
 doi = {10.1142/S0218127404010709},
 journal = {Int. J. Bifurc. Chaos},
 pages = {2417--2423},
 title = {Exact Computation of the bifurcation Point B\({}_{\mbox{4}}\) of the
logistic Map and the Bailey-broadhurst Conjectures},
 url = {https://doi.org/10.1142/S0218127404010709},
 volume = {14},
 year = {2004}
}


[ 2003 ]


[ 8 ]
Ilias S. Kotsireas, Edmond Lau, and Richard Voino. Exact implicitization of polynomial curves and surfaces. SIGSAM Bull., 37:78, 2003. [ http ]
@article{DBLP:journals/cca/KotsireasLV03,
 author = {Ilias S. Kotsireas and
Edmond Lau and
Richard Voino},
 doi = {10.1145/990353.990364},
 journal = {{SIGSAM} Bull.},
 pages = {78},
 title = {Exact implicitization of polynomial curves and surfaces},
 url = {https://doi.org/10.1145/990353.990364},
 volume = {37},
 year = {2003}
}
[ 7 ]
Ioannis Z. Emiris and Ilias S. Kotsireas. Implicitization exploiting sparseness. In Ravi Janardan, Michiel H. M. Smid, and Debasis Dutta, editors, Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, October 7-9, 2003, volume 67, pages 281--297. DIMACS/AMS, 2003. [ http ]
@inproceedings{DBLP:conf/dimacs/EmirisK03,
 author = {Ioannis Z. Emiris and
Ilias S. Kotsireas},
 booktitle = {Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing,
Proceedings of a {DIMACS} Workshop, Piscataway, New Jersey, USA, October
7-9, 2003},
 doi = {10.1090/dimacs/067/11},
 editor = {Ravi Janardan and
Michiel H. M. Smid and
Debasis Dutta},
 pages = {281--297},
 publisher = {{DIMACS/AMS}},
 title = {Implicitization Exploiting Sparseness},
 url = {https://doi.org/10.1090/dimacs/067/11},
 volume = {67},
 year = {2003}
}
[ 6 ]
Ioannis Z. Emiris and Ilias S. Kotsireas. Implicit polynomial support optimized for sparseness. In Vipin Kumar, Marina L. Gavrilova, Chih Jeng Kenneth Tan, and Pierre L'Ecuyer, editors, Computational Science and Its Applications - ICCSA 2003, International Conference, Montreal, Canada, May 18-21, 2003, Proceedings, Part III, volume 2669, pages 397--406. Springer, 2003. [ http ]
@inproceedings{DBLP:conf/iccsa/EmirisK03,
 author = {Ioannis Z. Emiris and
Ilias S. Kotsireas},
 booktitle = {Computational Science and Its Applications - {ICCSA} 2003, International
Conference, Montreal, Canada, May 18-21, 2003, Proceedings, Part {III}},
 doi = {10.1007/3-540-44842-X_41},
 editor = {Vipin Kumar and
Marina L. Gavrilova and
Chih Jeng Kenneth Tan and
Pierre L'Ecuyer},
 pages = {397--406},
 publisher = {Springer},
 title = {Implicit Polynomial Support Optimized for Sparseness},
 url = {https://doi.org/10.1007/3-540-44842-X_41},
 volume = {2669},
 year = {2003}
}


[ 2002 ]


[ 5 ]
Robert M. Corless, André Galligo, Ilias S. Kotsireas, and Stephen M. Watt. A geometric-numeric algorithm for absolute factorization of multivariate polynomials. In Teo Mora, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2002, Lille, France, July 7-10, 2002, Proceedings, pages 37--45. ACM, 2002. [ http ]
@inproceedings{DBLP:conf/issac/CorlessGKW02,
 author = {Robert M. Corless and
Andr{\'{e}} Galligo and
Ilias S. Kotsireas and
Stephen M. Watt},
 booktitle = {Symbolic and Algebraic Computation, International Symposium {ISSAC}
2002, Lille, France, July 7-10, 2002, Proceedings},
 doi = {10.1145/780506.780512},
 editor = {Teo Mora},
 pages = {37--45},
 publisher = {{ACM}},
 title = {A geometric-numeric algorithm for absolute factorization of multivariate
polynomials},
 url = {https://doi.org/10.1145/780506.780512},
 year = {2002}
}


[ 2001 ]


[ 4 ]
Ilias S. Kotsireas. Homotopies and polynomial system solving I: basic principles. SIGSAM Bull., 35:19--32, 2001. [ http ]
@article{DBLP:journals/cca/Kotsireas01,
 author = {Ilias S. Kotsireas},
 doi = {10.1145/504331.504334},
 journal = {{SIGSAM} Bull.},
 pages = {19--32},
 title = {Homotopies and polynomial system solving {I:} basic principles},
 url = {https://doi.org/10.1145/504331.504334},
 volume = {35},
 year = {2001}
}
[ 3 ]
Robert M. Corless, Mark Giesbrecht, Mark van Hoeij, Ilias S. Kotsireas, and Stephen M. Watt. Towards factoring bivariate approximate polynomials. In Erich Kaltofen and Gilles Villard, editors, Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, ORCCA & University of Western Ontario, London, Ontario, Canada, July 22-25, 2001, pages 85--92. ACM, 2001. [ http ]
@inproceedings{DBLP:conf/issac/CorlessGHKW01,
 author = {Robert M. Corless and
Mark Giesbrecht and
Mark van Hoeij and
Ilias S. Kotsireas and
Stephen M. Watt},
 booktitle = {Proceedings of the 2001 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} 2001, {ORCCA} {\&} University of Western Ontario,
London, Ontario, Canada, July 22-25, 2001},
 doi = {10.1145/384101.384114},
 editor = {Erich Kaltofen and
Gilles Villard},
 pages = {85--92},
 publisher = {{ACM}},
 title = {Towards factoring bivariate approximate polynomials},
 url = {https://doi.org/10.1145/384101.384114},
 year = {2001}
}


[ 2000 ]


[ 2 ]
Robert M. Corless, Mark Giesbrecht, Ilias S. Kotsireas, and Stephen M. Watt. Numerical implicitization of parametric hypersurfaces with linear algebra. In John A. Campbell and Eugenio Roanes-Lozano, editors, Artificial Intelligence and Symbolic Computation, International Conference AISC 2000 Madrid, Spain, July 17-19, 2000, Revised Papers, volume 1930, pages 174--183. Springer, 2000. [ http ]
@inproceedings{DBLP:conf/aisc/CorlessGKW00,
 author = {Robert M. Corless and
Mark Giesbrecht and
Ilias S. Kotsireas and
Stephen M. Watt},
 booktitle = {Artificial Intelligence and Symbolic Computation, International Conference
{AISC} 2000 Madrid, Spain, July 17-19, 2000, Revised Papers},
 doi = {10.1007/3-540-44990-6_13},
 editor = {John A. Campbell and
Eugenio Roanes{-}Lozano},
 pages = {174--183},
 publisher = {Springer},
 title = {Numerical Implicitization of Parametric Hypersurfaces with Linear
Algebra},
 url = {https://doi.org/10.1007/3-540-44990-6_13},
 volume = {1930},
 year = {2000}
}


[ 1999 ]


[ 1 ]
Jean-Charles Faugère and Ilias S. Kotsireas. Symmetry theorems for the newtonian 4- and 5-body problems with equal masses. In Victor G. Ganzha, Ernst W. Mayr, and Evgenii V. Vorozhtsov, editors, Proceedings of the Second Workshop on Computer Algebra in Scientific Computing, CASC 1999, Munich, Germany, May 31 - June 4, 1999, pages 81--92. Springer, 1999. [ http ]
@inproceedings{DBLP:conf/casc/FaugereK99,
 author = {Jean{-}Charles Faug{\`{e}}re and
Ilias S. Kotsireas},
 booktitle = {Proceedings of the Second Workshop on Computer Algebra in Scientific
Computing, {CASC} 1999, Munich, Germany, May 31 - June 4, 1999},
 doi = {10.1007/978-3-642-60218-4_6},
 editor = {Victor G. Ganzha and
Ernst W. Mayr and
Evgenii V. Vorozhtsov},
 pages = {81--92},
 publisher = {Springer},
 title = {Symmetry Theorems for the Newtonian 4- and 5-body Problems with Equal
Masses},
 url = {https://doi.org/10.1007/978-3-642-60218-4_6},
 year = {1999}
}


[ 1998 ]




[ 1997 ]




[ 1996 ]




[ 1995 ]




[ 1994 ]




[ 1993 ]




[ 1992 ]




[ 1991 ]




[ 1990 ]




[ 1989 ]




[ 1988 ]




[ 1987 ]




[ 1986 ]




[ 1985 ]




[ 1984 ]




[ 1983 ]




[ 1982 ]




[ 1981 ]




[ 1980 ]




[ 1979 ]