default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLászló Lipták
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j58]Eddie Cheng, László Lipták, Ke Qiu, Zhizhang Shen
, Abhishek Vangipuram:
On the g-extra connectivity of augmented cubes. Theor. Comput. Sci. 970: 114059 (2023)- 2022
- [j57]Sambhav Gupta, Eddie Cheng, László Lipták:
Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs. Int. J. Comput. Math. Comput. Syst. Theory 7(4): 207-222 (2022) - [j56]Eddie Cheng, László Lipták, Ke Qiu, Zhizhang Shen:
A Note on Linearly Many Faults of Interconnection Networks. J. Interconnect. Networks 22(1): 2142017:1-2142017:6 (2022) - 2021
- [j55]Joshua Brudnak, László Lipták:
Connectivity Properties of Generalized K4-Hypercubes. J. Interconnect. Networks 21(3): 2150015:1-2150015:13 (2021) - [c1]Sambhav Gupta, Eddie Cheng, László Lipták:
Conditional Fractional Matching Preclusion for Burnt Pancake Graphs and Pancake-Like Graphs (Extended Abstract). COCOON 2021: 425-435 - 2020
- [j54]Cheng-Kuan Lin, Eddie Cheng, László Lipták:
Structure and Substructure Connectivity of Hypercube-Like Networks. Parallel Process. Lett. 30(3): 2040007:1-2040007:23 (2020)
2010 – 2019
- 2018
- [j53]Karimah Sweet, Li Li, Eddie Cheng, László Lipták, Daniel E. Steffy:
A Complete Classification of Which (n, k)-Star Graphs are Cayley Graphs. Graphs Comb. 34(1): 241-260 (2018) - 2017
- [j52]Eddie Cheng, Li Li, László Lipták, Sangho Shim, Daniel E. Steffy:
On the Problem of Determining which (n, k)-Star Graphs are Cayley Graphs. Graphs Comb. 33(1): 85-102 (2017) - [j51]Chun-Nan Hung, Cheng-Kuan Lin, Lih-Hsing Hsu, Eddie Cheng, László Lipták:
Strong Fault-Hamiltonicity for the Crossed Cube and Its Extensions. Parallel Process. Lett. 27(2): 1750005:1-1750005:25 (2017) - 2015
- [j50]Eddie Cheng, László Lipták, Lih-Hsing Hsu, Jimmy J. M. Tan, Cheng-Kuan Lin:
Conditional Matching Preclusion For The Star Graphs. Ars Comb. 120: 369-382 (2015) - 2014
- [j49]Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu, Eddie Cheng, László Lipták:
Conditional Fault Hamiltonicity of the Star Graph. Ars Comb. 113: 111-127 (2014) - [j48]Eddie Cheng, Philip Hu, Roger Jia, László Lipták, Brian Scholten, James R. Voss:
Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs. Int. J. Parallel Emergent Distributed Syst. 29(5): 499-512 (2014) - 2013
- [j47]Eddie Cheng, László Lipták, Ke Qiu, Zhizhang Shen:
Cyclic Vertex-Connectivity of Cayley Graphs Generated by Transposition Trees. Graphs Comb. 29(4): 835-841 (2013) - [j46]Eddie Cheng, László Lipták, Daniel E. Steffy:
Strong local diagnosability of (n, k)(n, k)-star graphs and Cayley graphs generated by 2-trees with missing edges. Inf. Process. Lett. 113(12): 452-456 (2013) - [j45]Eddie Cheng, László Lipták:
Diagnosability of Cayley graphs generated by transposition trees with missing edges. Inf. Sci. 238: 250-252 (2013) - [j44]Chun-Nan Hung, David Lu, Randy Jia, Cheng-Kuan Lin, László Lipták, Eddie Cheng, Jimmy J. M. Tan, Lih-Hsing Hsu:
4-ordered-Hamiltonian problems of the generalized Petersen graph GP(n, 4). Math. Comput. Model. 57(3-4): 595-601 (2013) - [j43]Eddie Cheng, László Lipták, Allen Yuan:
Linearly many faults in arrangement graphs. Networks 61(4): 281-289 (2013) - [j42]Ariana Angjeli, Eddie Cheng, László Lipták:
Linearly many faults in augmented cubes. Int. J. Parallel Emergent Distributed Syst. 28(5): 475-483 (2013) - [j41]Eddie Cheng, László Lipták:
Conditional Matching preclusion for (n, k)-Star Graphs. Parallel Process. Lett. 23(1) (2013) - [j40]Ariana Angjeli, Eddie Cheng, László Lipták:
Linearly many faults in dual-cube-like networks. Theor. Comput. Sci. 472: 1-8 (2013) - 2012
- [j39]Eddie Cheng, László Lipták:
Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products. Discret. Appl. Math. 160(12): 1699-1716 (2012) - [j38]Eddie Cheng, Marc J. Lipman, László Lipták:
Matching preclusion and conditional matching preclusion for regular interconnection networks. Discret. Appl. Math. 160(13-14): 1936-1954 (2012) - [j37]László Lipták, Eddie Cheng, Jong-Seok Kim, Sung Won Kim:
One-to-many node-disjoint paths of hyper-star networks. Discret. Appl. Math. 160(13-14): 2006-2014 (2012) - [j36]Lih-Hsing Hsu, Jimmy J. M. Tan, Eddie Cheng, László Lipták, Cheng-Kuan Lin, Ming Tsai:
Solution to an open problem on 4-ordered Hamiltonian graphs. Discret. Math. 312(15): 2356-2370 (2012) - [j35]Lih-Hsing Hsu, Eddie Cheng, László Lipták, Jimmy J. M. Tan, Cheng-Kuan Lin, Tung-Yang Ho:
Component connectivity of the hypercubes. Int. J. Comput. Math. 89(2): 137-145 (2012) - [j34]Eddie Cheng, László Lipták, Ke Qiu, Zhizhang Shen:
On deriving conditional diagnosability of interconnection networks. Inf. Process. Lett. 112(17-18): 674-677 (2012) - [j33]Eddie Cheng, László Lipták, Ke Qiu, Zhizhang Shen:
A Unified Approach to the Conditional Diagnosability of Interconnection Networks. J. Interconnect. Networks 13(3-4) (2012) - [j32]Eddie Cheng, Philip Hu, Roger Jia, László Lipták:
Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions. Networks 59(4): 349-356 (2012) - [j31]Eddie Cheng, Philip Hu, Roger Jia, László Lipták:
Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars. Networks 59(4): 357-364 (2012) - [j30]Jong-Seok Kim, Sung Won Kim, Eddie Cheng, László Lipták:
Topological properties of folded hyper-star networks. J. Supercomput. 59(3): 1336-1347 (2012) - 2011
- [j29]Weihua Yang, Zhao Zhang, Xiaofeng Guo, Eddie Cheng, László Lipták:
On the edge-connectivity of graphs with two orbits of the same size. Discret. Math. 311(16): 1768-1777 (2011) - [j28]Jong-Seok Kim, Eddie Cheng, László Lipták, Hyeong-Ok Lee:
A note on embeddings among folded hypercubes, even graphs and odd graphs. Int. J. Comput. Math. 88(5): 882-891 (2011) - [j27]Eddie Cheng, László Lipták, Marc J. Lipman, Matthew Toeniskoetter:
Conditional matching preclusion for the alternating group graphs and split-stars. Int. J. Comput. Math. 88(6): 1120-1136 (2011) - [j26]Allen Yuan, Eddie Cheng, László Lipták:
Linearly Many Faults in (n, k)-Star Graphs. Int. J. Found. Comput. Sci. 22(7): 1729-1745 (2011) - [j25]Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, László Lipták:
Independent spanning trees on even networks. Inf. Sci. 181(13): 2892-2905 (2011) - [j24]Eddie Cheng, László Lipták, Weihua Yang, Zhao Zhang, Xiaofeng Guo:
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees. Inf. Sci. 181(19): 4300-4308 (2011) - [j23]Eddie Cheng, Marc J. Lipman, László Lipták, David Sherman:
Conditional matching preclusion for the arrangement graphs. Theor. Comput. Sci. 412(45): 6279-6289 (2011) - [j22]Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, László Lipták:
Optimal Independent Spanning Trees on Odd Graphs. J. Supercomput. 56(2): 212-225 (2011) - 2010
- [j21]Eddie Cheng, László Lipták, David Sherman:
Matching preclusion for the (n, k)-bubble-sort graphs. Int. J. Comput. Math. 87(11): 2408-2418 (2010) - [j20]Eddie Cheng, Jerrold W. Grossman, László Lipták, Ke Qiu, Zhizhang Shen:
Distance formula and shortest paths for the (n, k)-star graphs. Inf. Sci. 180(9): 1671-1680 (2010) - [j19]Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu, Eddie Cheng, László Lipták:
On the Existence of Disjoint Spanning Paths in Faulty Hypercubes. J. Interconnect. Networks 11(1-2): 71-96 (2010) - [j18]David Sherman, Ming Tsai, Cheng-Kuan Lin, László Lipták, Eddie Cheng, Jimmy J. M. Tan, Lih-Hsing Hsu:
4-Ordered Hamiltonicity for Some Chordal Ring Graphs. J. Interconnect. Networks 11(3-4): 157-174 (2010) - [j17]Eddie Cheng, László Lipták, Fred Sala:
Linearly many faults in 2-tree-generated networks. Networks 55(2): 90-98 (2010)
2000 – 2009
- 2009
- [j16]Jong-Seok Kim, Eddie Cheng, László Lipták, Hyeong-Ok Lee:
Embedding hypercubes, rings, and odd graphs into hyper-stars. Int. J. Comput. Math. 86(5): 771-778 (2009) - [j15]Eddie Cheng, Linda M. Lesniak, Marc J. Lipman, László Lipták:
Conditional matching preclusion sets. Inf. Sci. 179(8): 1092-1101 (2009) - 2008
- [j14]Eddie Cheng, László Lipták, Nart Shawash:
Orienting Cayley graphs generated by transposition trees. Comput. Math. Appl. 55(11): 2662-2672 (2008) - [j13]Eddie Cheng, Marc J. Lipman, László Lipták:
Strong structural properties of unidirectional star graphs. Discret. Appl. Math. 156(15): 2939-2949 (2008) - [j12]Eddie Cheng, Linda M. Lesniak, Marc J. Lipman, László Lipták:
Matching preclusion for Alternating Group Graphs and their Generalizations. Int. J. Found. Comput. Sci. 19(6): 1413-1437 (2008) - [j11]Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu, Eddie Cheng, László Lipták:
Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the Comparison Diagnosis Model. J. Interconnect. Networks 9(1/2): 83-97 (2008) - [j10]Eddie Cheng, Marc J. Lipman, László Lipták, David Stiebel:
Hamiltonian connectivity of 2-tree-generated networks. Math. Comput. Model. 48(5-6): 787-804 (2008) - 2007
- [j9]Eddie Cheng, László Lipták:
Fault Resiliency of Cayley Graphs Generated by Transpositions. Int. J. Found. Comput. Sci. 18(5): 1005-1022 (2007) - [j8]Eddie Cheng, László Lipták:
Linearly many faults in Cayley graphs generated by transposition trees. Inf. Sci. 177(22): 4877-4882 (2007) - [j7]Eddie Cheng, László Lipták:
Matching preclusion for some interconnection networks. Networks 50(2): 173-180 (2007) - 2006
- [j6]Eddie Cheng, László Lipták:
Structural Properties Of Hyper-Stars. Ars Comb. 80 (2006) - 2005
- [j5]László Lipták, Levent Tunçel:
Lift-and-project ranks and antiblocker duality. Oper. Res. Lett. 33(1): 35-41 (2005) - 2003
- [j4]László Lipták, Levent Tunçel:
The stable set problem and the lift-and-project ranks of graphs. Math. Program. 98(1-3): 319-353 (2003) - 2001
- [j3]László Lipták, László Lovász:
Critical Facets of the Stable Set Polytope. Comb. 21(1): 61-88 (2001) - 2000
- [j2]László Lipták, László Lovász:
Facets with fixed defect of the stable set polytope. Math. Program. 88(1): 33-44 (2000)
1990 – 1999
- 1997
- [j1]László Lipták:
Sperner systems containing at most k sets of every cardinality. Discret. Math. 170(1-3): 203-209 (1997)
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-04-25 05:53 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:
