default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharis Papadopoulos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j35]Charis Papadopoulos, Athanasios E. Zisis:
Computing and Listing Avoidable Vertices and Paths. Algorithmica 86(1): 281-306 (2024)- [j34]Charis Papadopoulos, Spyridon Tzimas:
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage. Algorithmica 86(3): 874-906 (2024) - 2023
- [c29]Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos
, Nikos Parotsidis:
Faster Computation of 3-Edge-Connected Components in Digraphs. SODA 2023: 2489-2531 - [c28]Giuseppe F. Italiano, Athanasios L. Konstantinidis, Charis Papadopoulos:
Structural Parameterization of Cluster Deletion. WALCOM 2023: 371-383 - 2022
- [j33]Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle:
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width. Algorithmica 84(5): 1385-1417 (2022) - [j32]Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos:
Graph Square Roots of Small Distance from Degree One Graphs. Theory Comput. Syst. 66(4): 821-846 (2022) - [c27]Stelios Andreadis, Thanassis Mavropoulos, Nick Pantelidis, Stefanos Vrochidis, Mirette Elias, Charis Papadopoulos, Ilias Gialampoukidis, Ioannis Kompatsiaris:
SPARQL querying for validating the usage of automatically georeferenced social media data as human sensors for air quality. IVMSP 2022: 1-5 - [c26]Charis Papadopoulos, Spyridon Tzimas:
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage. IWOCA 2022: 466-479 - [c25]Charis Papadopoulos, Athanasios E. Zisis:
Computing and Listing Avoidable Vertices and Paths. LATIN 2022: 104-120 - 2021
- [j31]Athanasios L. Konstantinidis, Charis Papadopoulos:
Cluster Deletion on Interval Graphs and Split Related Graphs. Algorithmica 83(7): 2018-2046 (2021) - [i11]Charis Papadopoulos, Spyridon Tzimas:
Computing Subset Feedback Vertex Set via Leafage. CoRR abs/2103.03035 (2021) - [i10]Charis Papadopoulos, Athanasios Zisis:
Computing and Listing Avoidable Vertices and Paths. CoRR abs/2108.07160 (2021) - 2020
- [j30]Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos:
Parameterized Aspects of Strong Subgraph Closure. Algorithmica 82(7): 2006-2038 (2020) - [j29]Athanasios L. Konstantinidis, Charis Papadopoulos:
Maximizing the strong triadic closure in split graphs and proper interval graphs. Discret. Appl. Math. 285: 79-95 (2020) - [j28]Charis Papadopoulos, Spyridon Tzimas:
Subset feedback vertex set on graphs of bounded independent set size. Theor. Comput. Sci. 814: 177-188 (2020) - [c24]Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos:
Graph Square Roots of Small Distance from Degree One Graphs. LATIN 2020: 116-128 - [c23]Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle:
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. WG 2020: 388-400 - [i9]Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos:
Graph Square Roots of Small Distance from Degree One Graphs. CoRR abs/2010.05733 (2020)
2010 – 2019
- 2019
- [j27]Charis Papadopoulos, Spyridon Tzimas:
Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs. Discret. Appl. Math. 258: 204-221 (2019) - [c22]Athanasios L. Konstantinidis, Charis Papadopoulos:
Cluster Deletion on Interval Graphs and Split Related Graphs. MFCS 2019: 12:1-12:14 - [i8]Athanasios L. Konstantinidis, Charis Papadopoulos:
Cluster Deletion on Interval Graphs and Split Related Graphs. CoRR abs/1904.09470 (2019) - [i7]Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle:
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. CoRR abs/1910.00887 (2019) - 2018
- [j26]Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos:
Strong triadic closure in cographs and graphs of low maximum degree. Theor. Comput. Sci. 740: 76-84 (2018) - [c21]Charis Papadopoulos, Spyridon Tzimas:
Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size. IPEC 2018: 20:1-20:14 - [c20]Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos:
Parameterized Aspects of Strong Subgraph Closure. SWAT 2018: 23:1-23:13 - [i6]Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos:
Parameterized Aspects of Strong Subgraph Closure. CoRR abs/1802.10386 (2018) - [i5]Charis Papadopoulos, Spyridon Tzimas:
Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size. CoRR abs/1805.07141 (2018) - 2017
- [j25]Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis:
Sparse certificates for 2-connectivity in directed graphs. Theor. Comput. Sci. 698: 40-66 (2017) - [c19]Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos:
Strong Triadic Closure in Cographs and Graphs of Low Maximum Degree. COCOON 2017: 346-358 - [c18]Charis Papadopoulos, Spyridon Tzimas:
Polynomial-Time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs. FCT 2017: 381-394 - [c17]Athanasios L. Konstantinidis, Charis Papadopoulos:
Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs. ISAAC 2017: 53:1-53:12 - [i4]Charis Papadopoulos, Spyridon Tzimas:
Polynomial-time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs. CoRR abs/1701.04634 (2017) - 2016
- [j24]Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics:
Clique-width of path powers. Discret. Appl. Math. 205: 62-72 (2016) - [c16]Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis:
Sparse Subgraphs for 2-Connectivity in Directed Graphs. SEA 2016: 150-166 - [i3]Athanasios L. Konstantinidis, Charis Papadopoulos:
Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs. CoRR abs/1609.09433 (2016) - 2015
- [j23]Bruno Courcelle, Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics:
A characterisation of clique-width through nested partitions. Discret. Appl. Math. 187: 70-81 (2015) - [c15]Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis:
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. ESA 2015: 582-594 - [i2]Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis:
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. CoRR abs/1509.02841 (2015) - 2014
- [j22]Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger:
Enumerating Minimal Subset Feedback Vertex Sets. Algorithmica 69(1): 216-231 (2014) - [j21]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
Counting spanning trees using modular decomposition. Theor. Comput. Sci. 526: 41-57 (2014) - 2013
- [c14]Charis Papadopoulos, Costas Voglis:
Untangling graphs representing spatial relationships driven by drawing aesthetics. Panhellenic Conference on Informatics 2013: 158-165 - 2012
- [j20]Pinar Heggernes, Daniel Meister, Charis Papadopoulos:
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs. Discret. Appl. Math. 160(6): 888-901 (2012) - [j19]Charis Papadopoulos:
Restricted vertex multicut on permutation graphs. Discret. Appl. Math. 160(12): 1791-1797 (2012) - [j18]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
A fully dynamic algorithm for the recognition of P4-sparse graphs. Theor. Comput. Sci. 439: 41-57 (2012) - 2011
- [j17]Stavros D. Nikolopoulos, Charis Papadopoulos:
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs. Graphs Comb. 27(4): 557-565 (2011) - [j16]Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan:
Strongly chordal and chordal bipartite graphs are sandwich monotone. J. Comb. Optim. 22(3): 438-456 (2011) - [j15]Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos:
Cutwidth of Split Graphs and Threshold Graphs. SIAM J. Discret. Math. 25(3): 1418-1437 (2011) - [j14]Pinar Heggernes, Daniel Meister, Charis Papadopoulos:
Graphs of linear clique-width at most 3. Theor. Comput. Sci. 412(39): 5466-5486 (2011) - [c13]Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger:
Enumerating Minimal Subset Feedback Vertex Sets. WADS 2011: 399-410 - [c12]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
Counting Spanning Trees in Graphs Using Modular Decomposition. WALCOM 2011: 202-213 - 2010
- [j13]Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos:
Characterizing and computing minimal cograph completions. Discret. Appl. Math. 158(7): 755-764 (2010) - [j12]Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond:
Clustering with partial information. Theor. Comput. Sci. 411(7-9): 1202-1211 (2010)
2000 – 2009
- 2009
- [j11]Stavros D. Nikolopoulos, Charis Papadopoulos:
Counting Spanning Trees in Cographs: An Algorithmic Approach. Ars Comb. 90 (2009) - [j10]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
Maximizing the number of spanning trees in Kn-complements of asteroidal graphs. Discret. Math. 309(10): 3049-3060 (2009) - [j9]Pinar Heggernes, Daniel Meister, Charis Papadopoulos:
A new representation of proper interval graphs with an application to clique-width. Electron. Notes Discret. Math. 32: 27-34 (2009) - [j8]Pinar Heggernes, Charis Papadopoulos:
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions. Theor. Comput. Sci. 410(1): 1-15 (2009) - [c11]Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan:
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. COCOON 2009: 398-407 - [c10]Stavros D. Nikolopoulos, Charis Papadopoulos:
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs. CTW 2009: 23-27 - [c9]Pinar Heggernes, Daniel Meister, Charis Papadopoulos:
A Complete Characterisation of the Linear Clique-Width of Path Powers. TAMC 2009: 241-250 - 2008
- [j7]Pinar Heggernes, Federico Mancini, Charis Papadopoulos:
Minimal comparability completions of arbitrary graphs. Discret. Appl. Math. 156(5): 705-718 (2008) - [c8]Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos:
Characterizing and Computing Minimal Cograph Completions. FAW 2008: 147-158 - [c7]Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond:
Clustering with Partial Information. MFCS 2008: 144-155 - [c6]Pinar Heggernes, Daniel Meister, Charis Papadopoulos:
Graphs of Linear Clique-Width at Most 3. TAMC 2008: 330-341 - [c5]Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos:
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. WG 2008: 218-229 - 2007
- [j6]Charis Papadopoulos, Constantinos Voglis:
Drawing graphs using modular decomposition. J. Graph Algorithms Appl. 11(2): 481-511 (2007) - [j5]Katerina Asdre, Stavros D. Nikolopoulos, Charis Papadopoulos:
An optimal parallel solution for the path cover problem on P4-sparse graphs. J. Parallel Distributed Comput. 67(1): 63-76 (2007) - [c4]Pinar Heggernes, Charis Papadopoulos:
Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions. COCOON 2007: 406-416 - 2006
- [j4]Stavros D. Nikolopoulos, Charis Papadopoulos:
On the number of spanning trees of Knm±G graphs. Discret. Math. Theor. Comput. Sci. 8(1): 235-248 (2006) - [c3]Pinar Heggernes, Federico Mancini, Charis Papadopoulos:
Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. ISAAC 2006: 419-428 - [c2]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs. WG 2006: 256-268 - 2005
- [b1]Charis Papadopoulos:
Αλγόριθμοι σε κατηγορίες τέλειων γραφημάτων. University of Ioannina, Greece, 2005 - [c1]Charis Papadopoulos, Constantinos Voglis:
Drawing Graphs Using Modular Decomposition. GD 2005: 343-354 - [i1]Stavros D. Nikolopoulos, Charis Papadopoulos:
The Number of Spanning Trees in Kn-complements of Quasi-threshold Graphs. CoRR abs/cs/0502038 (2005) - 2004
- [j3]Stavros D. Nikolopoulos, Charis Papadopoulos:
The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs. Graphs Comb. 20(3): 383-397 (2004) - 2003
- [j2]Stavros D. Nikolopoulos, Charis Papadopoulos:
Counting Spanning Trees in Cographs. Electron. Notes Discret. Math. 13: 84-92 (2003) - 2000
- [j1]Stavros D. Nikolopoulos, Charis Papadopoulos:
On the performance of the first-fit coloring algorithm on permutation graphs. Inf. Process. Lett. 75(6): 265-273 (2000)
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-10-07 21:18 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:
