The k-factor conjecture is true. - Sukhamay Kundu (Discret. Math., 1973)

A matroid generalization of a theorem of Mendelsohn and Dulmage. - Sukhamay Kundu; Eugene L. Lawler (Discret. Math., 1973)

Generalizations of the k-factor theorem. - Sukhamay Kundu (Discret. Math., 1974)

A factorization theorem for a certain class of graphs. - Sukhamay Kundu (Discret. Math., 1974)

Existence of Graphs with Three Spanning Trees and Given Degree Sequence. - Sukhamay Kundu (SIAM J. Comput., 1974)

A Linear Algorithm for the Hamiltonian Completion Number of a Tree. - Sukhamay Kundu (Inf. Process. Lett., 1976)

Sorting Tree, Nestling Tree and Inverse Permutation. - Sukhamay Kundu (Inf. Process. Lett., 1977)

The Chartrand-Schuster conjecture: Graphs with unique distance trees are regular. - Sukhamay Kundu (J. Comb. Theory B, 1977)

A Linear Tree Partitioning Algorithm. - Sukhamay Kundu; Jayadev Misra (SIAM J. Comput., 1977)

Note on a Constrained-Path Problem in Program Testing. - Sukhamay Kundu (IEEE Trans. Software Eng., 1978)

An Intermediate-Value Theorem for Optimum Tree Valuation. - Sukhamay Kundu (Inf. Process. Lett., 1979)

Reconstruction of a Pair of Graphs from their Concatenations. - Sukhamay Kundu; E. Sampathkumar 001; James B. Shearer; Dean Sturtevant (SIAM J. Algebraic Discret. Methods, 1980)

An O(V) algorithm M for computing transitive reduction of a planar acyclic digraph. - Sukhamay Kundu (ACM Southeast Regional Conference, 1982)

An Improved Algorithm for Finding a Key of a Relation. - Sukhamay Kundu (PODS, 1985)

Analysis of the Context Dependency of CODASYL Find-Statements with Application to Database Program Conversion. - G. Barbara Demo; Sukhamay Kundu (SIGMOD Conference, 1985)

Tree resolution and generalized semantic tree. - Sukhamay Kundu (ISMIS, 1986)

Modeling the CODASYL DML context dependency for database program conversion. - G. Barbara Demo; Sukhamay Kundu (Inf. Syst., 1986)

The Call-Return Tree and Its Application to Program Performance Analysis. - Sukhamay Kundu (IEEE Trans. Software Eng., 1986)

Rule-Discovery from Examples Using a Combination of Syntactic and Semantic Information. - Sukhamay Kundu (ISMIS, 1987)

A new O(n*log n) algorithm for computing the intersection of convex polygons. - Sukhamay Kundu (Pattern Recognit., 1987)

A Correct Form of the Satisfiability-Graph Based Decision Algorithm for Linear Propositional Temporal Logic. - Sukhamay Kundu (ISMIS, 1988)

The Equivalence of the Subregion Representation and the Wall Representation for a Certain Class of Rectangular Dissections. - Sukhamay Kundu (Commun. ACM, 1988)

A New and Simple Method for Explicit Computation of a Circumscription. - Sukhamay Kundu; Jianhua Chen 003 (GWAI, 1990)

An O(kN.log N) algorithm for decomposing a set of polygons into d-separable components. - Sukhamay Kundu; Sridhar Radhakrishnan (Pattern Recognit., 1990)

A New Logic of Beliefs: Monotonic and Non-Monotonic Beliefs - Part 1. - Sukhamay Kundu (IJCAI, 1991)

The Strong Semantics for Logic Programs. - Jianhua Chen 003; Sukhamay Kundu (ISMIS, 1991)

A new variant of the A-algorithm which closes a node at most once. - Sukhamay Kundu (Ann. Math. Artif. Intell., 1991)

Minimal Strings in a Regular Language with Respect to a Partial Order on the Alphabet. - Sukhamay Kundu (Theor. Comput. Sci., 1991)

An O(n) Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection. - Sukhamay Kundu (SIAM J. Comput., 1993)

A Sound and Complete Fuzzy Logic System Using Zadeh's Implication Operator. - Jianhua Chen 003; Sukhamay Kundu (ISMIS, 1996)

A new class of theories for which circumscription can be obtained via the predicate completion. - Sukhamay Kundu; Jianhua Chen 003 (J. Exp. Theor. Artif. Intell., 1996)

Min-transitivity of fuzzy leftness relationship and its application to decision making. - Sukhamay Kundu (Fuzzy Sets Syst., 1997)

A New Method of Circumscribing Beliefs: The Propositional Case. - Sukhamay Kundu; Jianhua Chen 003 (Fundam. Informaticae, 1997)

Preference relation on fuzzy utilities based on fuzzy leftness relation on intervals. - Sukhamay Kundu (Fuzzy Sets Syst., 1998)

The correct form of a recent result on level-subgroups of a fuzzy group. - Sukhamay Kundu (Fuzzy Sets Syst., 1998)

The min-max composition rule and its superiority over the usual max-min composition rule. - Sukhamay Kundu (Fuzzy Sets Syst., 1998)

Fuzzy logic or Lukasiewicz logic: A clarification. - Sukhamay Kundu; Jianhua Chen 003 (Fuzzy Sets Syst., 1998)

A solution to histogram-equalization and other related problems by shortest path methods. - Sukhamay Kundu (Pattern Recognit., 1998)

Membership functions for a fuzzy group from similarity relations. - Sukhamay Kundu (Fuzzy Sets Syst., 1999)

Gravitational clustering: a new approach based on the spatial distribution of the points. - Sukhamay Kundu (Pattern Recognit., 1999)

The concept of path-closed subsets and its use in software functional design. - Sukhamay Kundu (APSEC, 2000)

Similarity relations, fuzzy linear orders, and fuzzy partial orders. - Sukhamay Kundu (Fuzzy Sets Syst., 2000)

A representation theorem for min-transitive fuzzy relations. - Sukhamay Kundu (Fuzzy Sets Syst., 2000)

An optimal O(N2) algorithm for computing the min-transitive closure of a weighted graph. - Sukhamay Kundu (Inf. Process. Lett., 2000)

A better fitness measure of a text-document for a given set of keywords. - Sukhamay Kundu (Pattern Recognit., 2000)

Learning rules from numerical data by combining geometric and graph-theoretic approach. - Sukhamay Kundu; Jianhua Chen 003 (Robotics Auton. Syst., 2000)

The Canonical Functional Design Based on the Domination-Relationship among Data. - Sukhamay Kundu (APSEC, 2001)

The normal form of a granular fuzzy function. - Sukhamay Kundu (Fuzzy Sets Syst., 2001)

Finite-State Modeling in Software Design: Some Fundamental Techniques. - Sukhamay Kundu (APSEC, 2002)

Modeling Complex Systems by A Set of Interacting Finite-State Models. - Sukhamay Kundu (APSEC, 2003)

Random Generation of Combinatorial Structures using Context-Fee Grammars. - Sukhamay Kundu (Electron. Notes Discret. Math., 2003)

A Modern Graphic Flowchart Layout Tool. - Sukhamay Kundu (ICDCIT, 2004)

A Formal Approach to Designing a Class-Subclass Structure Using a Partial-Order on the Functions. - Sukhamay Kundu; Nigel Gwee (COMPSAC (1), 2005)

Deadlock-Free Distributed Relaxed Mutual-Exclusion Without Revoke-Messages. - Sukhamay Kundu (IWDC, 2005)

Conflating two polygonal lines. - Sukhamay Kundu (Pattern Recognit., 2006)

Structuring Software Functional Requirements For Automated Design And Verification. - Sukhamay Kundu (COMPSAC (1), 2007)

Reliable and Efficient Data Transfer in Wireless Sensor Networks via Out-of-Sequence Forwarding and Delayed Request for Missing Packets. - Damayanti Datta; Sukhamay Kundu (ITNG, 2007)

A software tool for optimal class-hierarchy design based on the use-relationship among functions and variables. - Nigel Gwee; Sukhamay Kundu (SEDE, 2007)

Using data-integrity constraints in model-based design. - Sukhamay Kundu (SEDE, 2007)

Finding Shortest Multi-Paths with O(N2) Message Complexity. - Jerrolyn Brees; Sukhamay Kundu (PDCCS, 2008)

EasyMAC: A New and Simple Protocol for Slot Assignment. - Jerrolyn Brees; Sukhamay Kundu (PDCCS, 2008)

Teaching Software Modeling and Design Based on The Science of Design and Science of Learning. - Sukhamay Kundu (FECS, 2008)

Orthogonal Decomposition of Finite-State Behavior Models As a Basis for Determining Components in Software Architectures. - Sukhamay Kundu (SETP, 2008)

An Application-Specific Reliable Data Transfer Protocol in Wireless Sensor Networks. - Damayanti Datta; Sukhamay Kundu (J. Networks, 2008)

Content-Model Based Course Design for Active Learning, Critical Thinking and Creativity. - Sukhamay Kundu (FECS, 2009)

Shape Recognition Using a New Spatial Representation and a D.P. Matching Algorithm. - Shiyuan Gu; Sukhamay Kundu (ICAPR, 2009)

A Distributed O(|E|) Algorithm for Optimal Link-Reversal. - Sukhamay Kundu (ICDCN, 2009)

Requirements Engineering by Connecting Requirements Directly to Data and Operations during Modeling. - Sukhamay Kundu (ICSEA, 2009)

Approximation of CFL by Regular Languages for Concurrent Program Verification. - Sukhamay Kundu; Supratik Mukhopadhyay (COMPSAC Workshops, 2010)

Service-learning and Active-learning: An Experience-based Comparison. - Sukhamay Kundu (FECS, 2010)

A linear time algorithm for optimal k-hop dominating set of a tree. - Sukhamay Kundu; Subhashis Majumder (Inf. Process. Lett., 2016)

A generalized linear time algorithm for an optimal k-distance dominating set of a weighted tree. - Sukhamay Kundu (Inf. Process. Lett., 2018)

Peachy Parallel Assignments (EduHPC 2019). - 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 (EduHPC@SC, 2019)

Relationship between optimal k-distance dominating sets in a weighted graph and its spanning trees. - Sukhamay Kundu (Inf. Process. Lett., 2019)

A More Powerful Heuristic for Balancing an Unbalanced Graph. - Sukhamay Kundu; Amit Anil Nanavati (COMPLEX NETWORKS (2), 2022)

A Better Linear Model Than Regression-Line for Data-Mining Applications. - Sukhamay Kundu (DMBD (2), 2022)

A Correction to the Heuristic Algorithm MinimalFlipSet to Balance Unbalanced Graphs. - Sukhamay Kundu; Amit Anil Nanavati (COMPLEX NETWORKS (3), 2023)