default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSukhamay Kundu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c37]Sukhamay Kundu, Amit Anil Nanavati
:
A Correction to the Heuristic Algorithm MinimalFlipSet to Balance Unbalanced Graphs. COMPLEX NETWORKS (3) 2023: 134-146- 2022
- [c36]Sukhamay Kundu, Amit Anil Nanavati:
A More Powerful Heuristic for Balancing an Unbalanced Graph. COMPLEX NETWORKS (2) 2022: 31-42 - [c35]Sukhamay Kundu:
A Better Linear Model Than Regression-Line for Data-Mining Applications. DMBD (2) 2022: 70-79
2010 – 2019
- 2019
- [j42]Sukhamay Kundu:
Relationship between optimal k-distance dominating sets in a weighted graph and its spanning trees. Inf. Process. Lett. 147: 3-5 (2019) - [c34]Mulya Agung, Allen D. Malony, Hiroyuki Takizawa, David P. Bunde, Muhammad Alfian Amrizal, Steven Bogaerts, Ryusuke Egawa, Daniel A. Ellsworth, Jorge Fernández-Fabeiro, Arturo González-Escribano, Sukhamay Kundu, Alina Lazar:
Peachy Parallel Assignments (EduHPC 2019). EduHPC@SC 2019: 75-83 - 2018
- [j41]Sukhamay Kundu:
A generalized linear time algorithm for an optimal k-distance dominating set of a weighted tree. Inf. Process. Lett. 130: 58-62 (2018) - 2016
- [j40]Sukhamay Kundu, Subhashis Majumder:
A linear time algorithm for optimal k-hop dominating set of a tree. Inf. Process. Lett. 116(2): 197-202 (2016) - 2010
- [c33]Sukhamay Kundu, Supratik Mukhopadhyay:
Approximation of CFL by Regular Languages for Concurrent Program Verification. COMPSAC Workshops 2010: 353-358 - [c32]Sukhamay Kundu:
Service-learning and Active-learning: An Experience-based Comparison. FECS 2010: 291-296
2000 – 2009
- 2009
- [c31]Sukhamay Kundu:
Content-Model Based Course Design for Active Learning, Critical Thinking and Creativity. FECS 2009: 285-291 - [c30]Shiyuan Gu, Sukhamay Kundu:
Shape Recognition Using a New Spatial Representation and a D.P. Matching Algorithm. ICAPR 2009: 422-425 - [c29]Sukhamay Kundu:
A Distributed O(|E|) Algorithm for Optimal Link-Reversal. ICDCN 2009: 243-250 - [c28]Sukhamay Kundu:
Requirements Engineering by Connecting Requirements Directly to Data and Operations during Modeling. ICSEA 2009: 100-107 - 2008
- [j39]Damayanti Datta, Sukhamay Kundu:
An Application-Specific Reliable Data Transfer Protocol in Wireless Sensor Networks. J. Networks 3(6): 69-81 (2008) - [c27]Jerrolyn Brees, Sukhamay Kundu:
Finding Shortest Multi-Paths with O(N2) Message Complexity. PDCCS 2008: 1-6 - [c26]Jerrolyn Brees, Sukhamay Kundu:
EasyMAC: A New and Simple Protocol for Slot Assignment. PDCCS 2008: 141-146 - [c25]Sukhamay Kundu:
Teaching Software Modeling and Design Based on The Science of Design and Science of Learning. FECS 2008: 434-438 - [c24]Sukhamay Kundu:
Orthogonal Decomposition of Finite-State Behavior Models As a Basis for Determining Components in Software Architectures. SETP 2008: 77-84 - 2007
- [c23]Sukhamay Kundu:
Structuring Software Functional Requirements For Automated Design And Verification. COMPSAC (1) 2007: 127-136 - [c22]Damayanti Datta, Sukhamay Kundu:
Reliable and Efficient Data Transfer in Wireless Sensor Networks via Out-of-Sequence Forwarding and Delayed Request for Missing Packets. ITNG 2007: 128-133 - [c21]Sukhamay Kundu:
Using data-integrity constraints in model-based design. SEDE 2007: 288-295 - [c20]Nigel Gwee, Sukhamay Kundu:
A software tool for optimal class-hierarchy design based on the use-relationship among functions and variables. SEDE 2007: 326-331 - 2006
- [j38]Sukhamay Kundu:
Conflating two polygonal lines. Pattern Recognit. 39(3): 363-372 (2006) - 2005
- [c19]Sukhamay Kundu, Nigel Gwee:
A Formal Approach to Designing a Class-Subclass Structure Using a Partial-Order on the Functions. COMPSAC (1) 2005: 213-220 - [c18]Sukhamay Kundu:
Deadlock-Free Distributed Relaxed Mutual-Exclusion Without Revoke-Messages. IWDC 2005: 463-474 - 2004
- [c17]Sukhamay Kundu:
A Modern Graphic Flowchart Layout Tool. ICDCIT 2004: 329-335 - 2003
- [j37]Sukhamay Kundu:
Random Generation of Combinatorial Structures using Context-Fee Grammars. Electron. Notes Discret. Math. 15: 114 (2003) - [c16]Sukhamay Kundu:
Modeling Complex Systems by A Set of Interacting Finite-State Models. APSEC 2003: 380-389 - 2002
- [c15]Sukhamay Kundu:
Finite-State Modeling in Software Design: Some Fundamental Techniques. APSEC 2002: 317- - 2001
- [j36]Sukhamay Kundu:
The normal form of a granular fuzzy function. Fuzzy Sets Syst. 124(1): 97-107 (2001) - [c14]Sukhamay Kundu:
The Canonical Functional Design Based on the Domination-Relationship among Data. APSEC 2001: 89-96 - 2000
- [j35]Sukhamay Kundu:
Similarity relations, fuzzy linear orders, and fuzzy partial orders. Fuzzy Sets Syst. 109(3): 419-428 (2000) - [j34]Sukhamay Kundu:
A representation theorem for min-transitive fuzzy relations. Fuzzy Sets Syst. 109(3): 453-457 (2000) - [j33]Sukhamay Kundu:
An optimal O(N2) algorithm for computing the min-transitive closure of a weighted graph. Inf. Process. Lett. 74(5-6): 215-220 (2000) - [j32]Sukhamay Kundu:
A better fitness measure of a text-document for a given set of keywords. Pattern Recognit. 33(5): 841-848 (2000) - [j31]Sukhamay Kundu, Jianhua Chen:
Learning rules from numerical data by combining geometric and graph-theoretic approach. Robotics Auton. Syst. 33(2-3): 135-147 (2000) - [c13]Sukhamay Kundu:
The concept of path-closed subsets and its use in software functional design. APSEC 2000: 112-119
1990 – 1999
- 1999
- [j30]Sukhamay Kundu:
Membership functions for a fuzzy group from similarity relations. Fuzzy Sets Syst. 101(3): 391-402 (1999) - [j29]Sukhamay Kundu:
Gravitational clustering: a new approach based on the spatial distribution of the points. Pattern Recognit. 32(7): 1149-1160 (1999) - [c12]Sukhamay Kundu:
A Better Fitness Measure of a Text-Document for a Given Set of Keywords. ISMIS 1999: 217-225 - 1998
- [j28]Sukhamay Kundu:
The min-max composition rule and its superiority over the usual max-min composition rule. Fuzzy Sets Syst. 93(3): 319-329 (1998) - [j27]Sukhamay Kundu, Jianhua Chen:
Fuzzy logic or Lukasiewicz logic: A clarification. Fuzzy Sets Syst. 95(3): 369-379 (1998) - [j26]Sukhamay Kundu:
Preference relation on fuzzy utilities based on fuzzy leftness relation on intervals. Fuzzy Sets Syst. 97(2): 183-191 (1998) - [j25]Sukhamay Kundu:
The correct form of a recent result on level-subgroups of a fuzzy group. Fuzzy Sets Syst. 97(2): 261-263 (1998) - [j24]Sukhamay Kundu:
A solution to histogram-equalization and other related problems by shortest path methods. Pattern Recognit. 31(3): 231-234 (1998) - 1997
- [j23]Sukhamay Kundu:
Min-transitivity of fuzzy leftness relationship and its application to decision making. Fuzzy Sets Syst. 86(3): 357-367 (1997) - [j22]Sukhamay Kundu, Jianhua Chen:
A New Method of Circumscribing Beliefs: The Propositional Case. Fundam. Informaticae 29(4): 383-390 (1997) - 1996
- [j21]Sukhamay Kundu, Jianhua Chen:
A new class of theories for which circumscription can be obtained via the predicate completion. J. Exp. Theor. Artif. Intell. 8(2): 191-205 (1996) - [c11]Jianhua Chen, Sukhamay Kundu:
A Sound and Complete Fuzzy Logic System Using Zadeh's Implication Operator. ISMIS 1996: 233-242 - 1994
- [c10]Sukhamay Kundu, Jianhua Chen:
Fuzzy Logic or Lukasiewicz Logic: A Clarification. ISMIS 1994: 56-64 - 1993
- [j20]Sukhamay Kundu:
An O(n) Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection. SIAM J. Comput. 22(1): 79-101 (1993) - 1991
- [j19]Sukhamay Kundu:
A new variant of the A-algorithm which closes a node at most once. Ann. Math. Artif. Intell. 4: 157-176 (1991) - [j18]Sukhamay Kundu:
Minimal Strings in a Regular Language with Respect to a Partial Order on the Alphabet. Theor. Comput. Sci. 83(2): 287-300 (1991) - [c9]Sukhamay Kundu:
A New Logic of Beliefs: Monotonic and Non-Monotonic Beliefs - Part 1. IJCAI 1991: 486-491 - [c8]Jianhua Chen, Sukhamay Kundu:
The Strong Semantics for Logic Programs. ISMIS 1991: 490-499 - 1990
- [j17]Sukhamay Kundu, Sridhar Radhakrishnan:
An O(kN.log N) algorithm for decomposing a set of polygons into d-separable components. Pattern Recognit. 23(7): 735-743 (1990) - [c7]Sukhamay Kundu, Jianhua Chen:
A New and Simple Method for Explicit Computation of a Circumscription. GWAI 1990: 160-170
1980 – 1989
- 1988
- [j16]Sukhamay Kundu:
The Equivalence of the Subregion Representation and the Wall Representation for a Certain Class of Rectangular Dissections. Commun. ACM 31(6): 752-763 (1988) - [c6]Sukhamay Kundu:
A Correct Form of the Satisfiability-Graph Based Decision Algorithm for Linear Propositional Temporal Logic. ISMIS 1988: 454-465 - 1987
- [j15]Sukhamay Kundu:
A new O(n*log n) algorithm for computing the intersection of convex polygons. Pattern Recognit. 20(4): 419-424 (1987) - [c5]Sukhamay Kundu:
Rule-Discovery from Examples Using a Combination of Syntactic and Semantic Information. ISMIS 1987: 333-340 - 1986
- [j14]G. Barbara Demo, Sukhamay Kundu:
Modeling the CODASYL DML context dependency for database program conversion. Inf. Syst. 11(1): 87-100 (1986) - [j13]Sukhamay Kundu:
The Call-Return Tree and Its Application to Program Performance Analysis. IEEE Trans. Software Eng. 12(11): 1096-1101 (1986) - [c4]Sukhamay Kundu:
Tree resolution and generalized semantic tree. ISMIS 1986: 270-278 - 1985
- [c3]Sukhamay Kundu:
An Improved Algorithm for Finding a Key of a Relation. PODS 1985: 189-192 - [c2]G. Barbara Demo, Sukhamay Kundu:
Analysis of the Context Dependency of CODASYL Find-Statements with Application to Database Program Conversion. SIGMOD Conference 1985: 354-361 - 1982
- [c1]Sukhamay Kundu:
An O(V) algorithm M for computing transitive reduction of a planar acyclic digraph. ACM Southeast Regional Conference 1982: 29 - 1980
- [j12]Sukhamay Kundu, E. Sampathkumar, James B. Shearer, Dean Sturtevant:
Reconstruction of a Pair of Graphs from their Concatenations. SIAM J. Algebraic Discret. Methods 1(2): 228-231 (1980)
1970 – 1979
- 1979
- [j11]Sukhamay Kundu:
An Intermediate-Value Theorem for Optimum Tree Valuation. Inf. Process. Lett. 8(3): 141-145 (1979) - 1978
- [j10]Sukhamay Kundu:
Note on a Constrained-Path Problem in Program Testing. IEEE Trans. Software Eng. 4(1): 75-76 (1978) - 1977
- [j9]Sukhamay Kundu:
Sorting Tree, Nestling Tree and Inverse Permutation. Inf. Process. Lett. 6(3): 94-96 (1977) - [j8]Sukhamay Kundu:
The Chartrand-Schuster conjecture: Graphs with unique distance trees are regular. J. Comb. Theory B 22(3): 233-245 (1977) - [j7]Sukhamay Kundu, Jayadev Misra:
A Linear Tree Partitioning Algorithm. SIAM J. Comput. 6(1): 151-154 (1977) - 1976
- [j6]Sukhamay Kundu:
A Linear Algorithm for the Hamiltonian Completion Number of a Tree. Inf. Process. Lett. 5(2): 55-57 (1976) - 1974
- [j5]Sukhamay Kundu:
A factorization theorem for a certain class of graphs. Discret. Math. 8(1): 41-47 (1974) - [j4]Sukhamay Kundu:
Generalizations of the k-factor theorem. Discret. Math. 9(2): 173-179 (1974) - [j3]Sukhamay Kundu:
Existence of Graphs with Three Spanning Trees and Given Degree Sequence. SIAM J. Comput. 3(4): 296-298 (1974) - 1973
- [j2]Sukhamay Kundu, Eugene L. Lawler:
A matroid generalization of a theorem of Mendelsohn and Dulmage. Discret. Math. 4(2): 159-163 (1973) - [j1]Sukhamay Kundu:
The k-factor conjecture is true. Discret. Math. 6(4): 367-376 (1973)
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 2025-01-20 23:58 CET 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:
