default search action
Dimitris J. Kavvadias
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j16]Stavros S. Cosmadakis
, Dimitris J. Kavvadias, Lina Panagopoulou
Resolution based algorithms for the transversal hypergraph generation problem. Theor. Comput. Sci. 815: 1-10 (2020)
2010 – 2019
- 2018
- [j15]Dimitra-Nefeli A. Zottou, Dimitris J. Kavvadias, Frosso S. Makri, Michael N. Vrahatis:
Algorithm 987: MANBIS - A C++ Mathematical Software Package for Locating and Computing Efficiently Many Roots of a Function: Theoretical Issues. ACM Trans. Math. Softw. 44(3): 35:1-35:7 (2018) - [c12]Dimitris J. Kavvadias, Lina Panagopoulou:
A semantic view of the switching lemma. GASCom 2018: 166-171 - 2015
- [j14]Ioannis Voyiatzis, Dimitris J. Kavvadias:
On the Generation of SIC Pairs in Optimal Time. IEEE Trans. Computers 64(10): 2891-2901 (2015) - [c11]Ioannis Voyiatzis, Dimitris J. Kavvadias, S. Sinitos, K. Vlahantonis, P. Kyrkos, Cleo Sgouropoulou
Test set embedding into hardware generated sequences using an embedding algorithm. DTIS 2015: 1-2 - 2010
- [c10]Dimitris J. Kavvadias, S. Sinitos, Ioannis Voyiatzis, Hera Antonopoulou, Costas Efstathiou:
On Embedding Test Sets into Hardware Generated Sequences. Panhellenic Conference on Informatics 2010: 158-163
2000 – 2009
- 2009
- [j13]George F. Georgakopoulos, Dimitris J. Kavvadias, Leonidas G. Sioutis:
Nash equilibria in all-optical networks. Discret. Math. 309(13): 4332-4342 (2009) - 2008
- [j12]Nicolas Hanusse, Dimitris J. Kavvadias, Evangelos Kranakis
Memoryless search algorithms in a network with faulty advice. Theor. Comput. Sci. 402(2-3): 190-198 (2008) - 2007
- [c9]Ioannis Voyiatzis, Dimitris J. Kavvadias, Hera Antonopoulou, S. Sinitos:
Reliability considerations in mobile devices. MobiMedia 2007: 51 - 2005
- [j11]Dimitris J. Kavvadias, Elias C. Stavropoulos:
An Efficient Algorithm for the Transversal Hypergraph Generation. J. Graph Algorithms Appl. 9(2): 239-264 (2005) - [j10]Dimitris J. Kavvadias, Frosso S. Makri, Michael N. Vrahatis:
Efficiently Computing Many Roots of a Function. SIAM J. Sci. Comput. 27(1): 93-107 (2005) - [c8]George F. Georgakopoulos, Dimitris J. Kavvadias, Leonidas G. Sioutis:
Nash Equilibria in All-Optical Networks. WINE 2005: 1033-1045 - [c7]D. Avramouli, John D. Garofalakis, Dimitris J. Kavvadias, Christos Makris
Popular web hot spots identification and visualization. WWW (Special interest tracks and posters) 2005: 912-913 - 2003
- [j9]Dimitris J. Kavvadias, Elias C. Stavropoulos:
Monotone Boolean dualization is in co-NP[log2n]. Inf. Process. Lett. 85(1): 1-6 (2003) - 2002
- [c6]Nicolas Hanusse, Dimitris J. Kavvadias, Evangelos Kranakis, Danny Krizanc:
Memoryless Search Algorithms in a Network with Faulty Advice. IFIP TCS 2002: 206-216 - 2000
- [j8]Dimitris J. Kavvadias, Martha Sideri, Elias C. Stavropoulos:
Generating all maximal models of a Boolean expression. Inf. Process. Lett. 74(3-4): 157-162 (2000)
1990 – 1999
- 1999
- [j7]Dimitris J. Kavvadias, Frosso S. Makri, Michael N. Vrahatis:
Locating and Computing Arbitrarily Distributed Zeros. SIAM J. Sci. Comput. 21(3): 954-969 (1999) - [c5]Dimitris J. Kavvadias, Elias C. Stavropoulos:
Evaluation of an Algorithm for the Transversal Hypergraph Problem. WAE 1999: 72-84 - 1998
- [j6]Dimitris J. Kavvadias, Martha Sideri:
The Inverse Satisfiability Problem. SIAM J. Comput. 28(1): 152-163 (1998) - 1996
- [j5]Dimitris J. Kavvadias, Michael N. Vrahatis:
Locating and Computing All the Simple Roots and Extrema of a Function. SIAM J. Sci. Comput. 17(5): 1232-1248 (1996) - [j4]Dimitris J. Kavvadias, Grammati E. Pantziou
Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems. Theor. Comput. Sci. 168(1): 121-154 (1996) - [c4]Dimitris J. Kavvadias, Martha Sideri:
The Inverse Satisfiability Problem. COCOON 1996: 250-259 - 1994
- [c3]Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem. ISAAC 1994: 270-278 - [c2]Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems. MFCS 1994: 462-472 - 1993
- [c1]Dimitris J. Kavvadias, Christos H. Papadimitriou, Martha Sideri:
On Horn Envelopes and Hypergraph Transversals. ISAAC 1993: 399-405 - 1990
- [j3]Dimitris J. Kavvadias, Christos H. Papadimitriou:
A Linear Programming Approach to Reasoning about Probabilities. Ann. Math. Artif. Intell. 1: 189-205 (1990) - [j2]George K. Georgakopoulos, Dimitris J. Kavvadias:
The Banker's Problem with Precedences. Inf. Comput. 84(1): 1-12 (1990)
1980 – 1989
- 1988
- [b1]Dimitris J. Kavvadias:
ΠΟΛΥΠΛΟΚΟΤΗΤΑ ΚΑΙ ΕΥΡΕΤΙΚΕΣ ΜΕΘΟΔΟΙ ΓΙΑ ΤΗΝ ΠΙΘΑΝΟΤΙΚΗ ΛΟΓΙΚΗ. University of Patras, Greece, 1988 - [j1]George F. Georgakopoulos, Dimitris J. Kavvadias, Christos H. Papadimitriou:
Probabilistic satisfiability. J. Complex. 4(1): 1-11 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-02 20:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: