Sukhamay Kundu

Publication Activity (10 Years)

Years Active: 1973-2023
Publications (10 Years): 7

Top Topics

Computationally Tractable

Facility Location Problem

Top Venues

Inf. Process. Lett.

COMPLEX NETWORKS (3)

COMPLEX NETWORKS (2)

Publications

Sukhamay Kundu, Amit A. Nanavati
A Correction to the Heuristic Algorithm MinimalFlipSet to Balance Unbalanced Graphs. COMPLEX NETWORKS (3) (2023)
Sukhamay Kundu, Amit Anil Nanavati
A More Powerful Heuristic for Balancing an Unbalanced Graph. COMPLEX NETWORKS (2) (2022)
Sukhamay Kundu
A Better Linear Model Than Regression-Line for Data-Mining Applications. DMBD (2) (2022)
Sukhamay Kundu
-distance dominating sets in a weighted graph and its spanning trees. Inf. Process. Lett. 147 (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
Peachy Parallel Assignments (EduHPC 2019). EduHPC@SC (2019)
Sukhamay Kundu
-distance dominating set of a weighted tree. Inf. Process. Lett. 130 (2018)
Sukhamay Kundu, Subhashis Majumder
A linear time algorithm for optimal k-hop dominating set of a tree. Inf. Process. Lett. 116 (2) (2016)
Sukhamay Kundu
Service-learning and Active-learning: An Experience-based Comparison. FECS (2010)
Sukhamay Kundu, Supratik Mukhopadhyay
Approximation of CFL by Regular Languages for Concurrent Program Verification. COMPSAC Workshops (2010)
Sukhamay Kundu
A Distributed O(|E|) Algorithm for Optimal Link-Reversal. ICDCN (2009)
Sukhamay Kundu
Content-Model Based Course Design for Active Learning, Critical Thinking and Creativity. FECS (2009)
Shiyuan Gu, Sukhamay Kundu
Shape Recognition Using a New Spatial Representation and a D.P. Matching Algorithm. ICAPR (2009)
Sukhamay Kundu
Requirements Engineering by Connecting Requirements Directly to Data and Operations during Modeling. ICSEA (2009)
Jerrolyn Brees, Sukhamay Kundu
Finding Shortest Multi-Paths with O(N2) Message Complexity. PDCCS (2008)
Sukhamay Kundu
Teaching Software Modeling and Design Based on The Science of Design and Science of Learning. FECS (2008)
Sukhamay Kundu
Orthogonal Decomposition of Finite-State Behavior Models As a Basis for Determining Components in Software Architectures. SETP (2008)
Jerrolyn Brees, Sukhamay Kundu
EasyMAC: A New and Simple Protocol for Slot Assignment. PDCCS (2008)
Damayanti Datta, Sukhamay Kundu
An Application-Specific Reliable Data Transfer Protocol in Wireless Sensor Networks. J. Networks 3 (6) (2008)
Sukhamay Kundu
Using data-integrity constraints in model-based design. SEDE (2007)
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)
Sukhamay Kundu
Structuring Software Functional Requirements For Automated Design And Verification. COMPSAC (1) (2007)
Nigel Gwee, Sukhamay Kundu
A software tool for optimal class-hierarchy design based on the use-relationship among functions and variables. SEDE (2007)
Sukhamay Kundu
Conflating two polygonal lines. Pattern Recognit. 39 (3) (2006)
Sukhamay Kundu
Deadlock-Free Distributed Relaxed Mutual-Exclusion Without Revoke-Messages. IWDC (2005)
Sukhamay Kundu, Nigel Gwee
A Formal Approach to Designing a Class-Subclass Structure Using a Partial-Order on the Functions. COMPSAC (1) (2005)
Sukhamay Kundu
A Modern Graphic Flowchart Layout Tool. ICDCIT (2004)
Sukhamay Kundu
Random Generation of Combinatorial Structures using Context-Fee Grammars. Electron. Notes Discret. Math. 15 (2003)
Sukhamay Kundu
Modeling Complex Systems by A Set of Interacting Finite-State Models. APSEC (2003)
Sukhamay Kundu
Finite-State Modeling in Software Design: Some Fundamental Techniques. APSEC (2002)
Sukhamay Kundu
The normal form of a granular fuzzy function. Fuzzy Sets Syst. 124 (1) (2001)
Sukhamay Kundu
The Canonical Functional Design Based on the Domination-Relationship among Data. APSEC (2001)
Sukhamay Kundu
A better fitness measure of a text-document for a given set of keywords. Pattern Recognit. 33 (5) (2000)
Sukhamay Kundu
) algorithm for computing the min-transitive closure of a weighted graph. Inf. Process. Lett. 74 (5-6) (2000)
Sukhamay Kundu
A representation theorem for min-transitive fuzzy relations. Fuzzy Sets Syst. 109 (3) (2000)
Sukhamay Kundu, Jianhua Chen
Learning rules from numerical data by combining geometric and graph-theoretic approach. Robotics Auton. Syst. 33 (2-3) (2000)
Sukhamay Kundu
The concept of path-closed subsets and its use in software functional design. APSEC (2000)
Sukhamay Kundu
Similarity relations, fuzzy linear orders, and fuzzy partial orders. Fuzzy Sets Syst. 109 (3) (2000)
Sukhamay Kundu
A Better Fitness Measure of a Text-Document for a Given Set of Keywords. ISMIS (1999)
Sukhamay Kundu
Gravitational clustering: a new approach based on the spatial distribution of the points. Pattern Recognit. 32 (7) (1999)
Sukhamay Kundu
Membership functions for a fuzzy group from similarity relations. Fuzzy Sets Syst. 101 (3) (1999)
Sukhamay Kundu
The min-max composition rule and its superiority over the usual max-min composition rule. Fuzzy Sets Syst. 93 (3) (1998)
Sukhamay Kundu
A solution to histogram-equalization and other related problems by shortest path methods. Pattern Recognit. 31 (3) (1998)
Sukhamay Kundu
The correct form of a recent result on level-subgroups of a fuzzy group. Fuzzy Sets Syst. 97 (2) (1998)
Sukhamay Kundu, Jianhua Chen
Fuzzy logic or Lukasiewicz logic: A clarification. Fuzzy Sets Syst. 95 (3) (1998)
Sukhamay Kundu
Preference relation on fuzzy utilities based on fuzzy leftness relation on intervals. Fuzzy Sets Syst. 97 (2) (1998)
Sukhamay Kundu
Min-transitivity of fuzzy leftness relationship and its application to decision making. Fuzzy Sets Syst. 86 (3) (1997)
Sukhamay Kundu, Jianhua Chen
A New Method of Circumscribing Beliefs: The Propositional Case. Fundam. Informaticae 29 (4) (1997)
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) (1996)
Jianhua Chen, Sukhamay Kundu
A Sound and Complete Fuzzy Logic System Using Zadeh's Implication Operator. ISMIS (1996)
Sukhamay Kundu, Jianhua Chen
Fuzzy Logic or Lukasiewicz Logic: A Clarification. ISMIS (1994)
Sukhamay Kundu
An O(n) Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection. SIAM J. Comput. 22 (1) (1993)
Sukhamay Kundu
Minimal Strings in a Regular Language with Respect to a Partial Order on the Alphabet. Theor. Comput. Sci. 83 (2) (1991)
Sukhamay Kundu
A New Logic of Beliefs: Monotonic and Non-Monotonic Beliefs - Part 1. IJCAI (1991)
Sukhamay Kundu
A new variant of the A-algorithm which closes a node at most once. Ann. Math. Artif. Intell. 4 (1991)
Jianhua Chen, Sukhamay Kundu
The Strong Semantics for Logic Programs. ISMIS (1991)
Sukhamay Kundu, Sridhar Radhakrishnan
An O(kN.log N) algorithm for decomposing a set of polygons into d-separable components. Pattern Recognit. 23 (7) (1990)
Sukhamay Kundu, Jianhua Chen
A New and Simple Method for Explicit Computation of a Circumscription. GWAI (1990)
Sukhamay Kundu
The Equivalence of the Subregion Representation and the Wall Representation for a Certain Class of Rectangular Dissections. Commun. ACM 31 (6) (1988)
Sukhamay Kundu
A Correct Form of the Satisfiability-Graph Based Decision Algorithm for Linear Propositional Temporal Logic. ISMIS (1988)
Sukhamay Kundu
Rule-Discovery from Examples Using a Combination of Syntactic and Semantic Information. ISMIS (1987)
Sukhamay Kundu
A new O(n*log n) algorithm for computing the intersection of convex polygons. Pattern Recognit. 20 (4) (1987)
Sukhamay Kundu
Tree resolution and generalized semantic tree. ISMIS (1986)
Sukhamay Kundu
The Call-Return Tree and Its Application to Program Performance Analysis. IEEE Trans. Software Eng. 12 (11) (1986)
G. Barbara Demo, Sukhamay Kundu
Modeling the CODASYL DML context dependency for database program conversion. Inf. Syst. 11 (1) (1986)
Sukhamay Kundu
An Improved Algorithm for Finding a Key of a Relation. PODS (1985)
G. Barbara Demo, Sukhamay Kundu
Analysis of the Context Dependency of CODASYL Find-Statements with Application to Database Program Conversion. SIGMOD Conference (1985)
Sukhamay Kundu
An O(V) algorithm M for computing transitive reduction of a planar acyclic digraph. ACM Southeast Regional Conference (1982)
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) (1980)
Sukhamay Kundu
An Intermediate-Value Theorem for Optimum Tree Valuation. Inf. Process. Lett. 8 (3) (1979)
Sukhamay Kundu
Note on a Constrained-Path Problem in Program Testing. IEEE Trans. Software Eng. 4 (1) (1978)
Sukhamay Kundu
The Chartrand-Schuster conjecture: Graphs with unique distance trees are regular. J. Comb. Theory, Ser. B 22 (3) (1977)
Sukhamay Kundu
Sorting Tree, Nestling Tree and Inverse Permutation. Inf. Process. Lett. 6 (3) (1977)
Sukhamay Kundu, Jayadev Misra
A Linear Tree Partitioning Algorithm. SIAM J. Comput. 6 (1) (1977)
Sukhamay Kundu
A Linear Algorithm for the Hamiltonian Completion Number of a Tree. Inf. Process. Lett. 5 (2) (1976)
Sukhamay Kundu
Existence of Graphs with Three Spanning Trees and Given Degree Sequence. SIAM J. Comput. 3 (4) (1974)
Sukhamay Kundu
A factorization theorem for a certain class of graphs. Discret. Math. 8 (1) (1974)
Sukhamay Kundu
Generalizations of the k-factor theorem. Discret. Math. 9 (2) (1974)
Sukhamay Kundu
The k-factor conjecture is true. Discret. Math. 6 (4) (1973)
Sukhamay Kundu, Eugene L. Lawler
A matroid generalization of a theorem of Mendelsohn and Dulmage. Discret. Math. 4 (2) (1973)