Sukhamay Kundu

According to our database1, Sukhamay Kundu authored at least 77 papers between 1973 and 2023.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A Correction to the Heuristic Algorithm MinimalFlipSet to Balance Unbalanced Graphs.
Proceedings of the Complex Networks & Their Applications XII, 2023

2022
A Better Linear Model Than Regression-Line for Data-Mining Applications.
Proceedings of the Data Mining and Big Data - 7th International Conference, 2022

A More Powerful Heuristic for Balancing an Unbalanced Graph.
Proceedings of the Complex Networks and Their Applications XI, 2022

2019
Relationship between optimal <i>k</i>-distance dominating sets in a weighted graph and its spanning trees.
Inf. Process. Lett., 2019

Peachy Parallel Assignments (EduHPC 2019).
Proceedings of the 2019 IEEE/ACM Workshop on Education for High-Performance Computing, 2019

2018
A generalized linear time algorithm for an optimal <i>k</i>-distance dominating set of a weighted tree.
Inf. Process. Lett., 2018

2016
A linear time algorithm for optimal k-hop dominating set of a tree.
Inf. Process. Lett., 2016

2010
Service-learning and Active-learning: An Experience-based Comparison.
Proceedings of the 2010 International Conference on Frontiers in Education: Computer Science & Computer Engineering, 2010

Approximation of CFL by Regular Languages for Concurrent Program Verification.
Proceedings of the Workshop Proceedings of the 34th Annual IEEE International Computer Software and Applications Conference, 2010

2009
Requirements Engineering by Connecting Requirements Directly to Data and Operations during Modeling.
Proceedings of the Fourth International Conference on Software Engineering Advances, 2009

A Distributed O(|E|) Algorithm for Optimal Link-Reversal.
Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

Shape Recognition Using a New Spatial Representation and a D.P. Matching Algorithm.
Proceedings of the Seventh International Conference on Advances in Pattern Recognition, 2009

Content-Model Based Course Design for Active Learning, Critical Thinking and Creativity.
Proceedings of the 2009 International Conference on Frontiers in Education: Computer Science & Computer Engineering, 2009

2008
An Application-Specific Reliable Data Transfer Protocol in Wireless Sensor Networks.
J. Networks, 2008

Orthogonal Decomposition of Finite-State Behavior Models As a Basis for Determining Components in Software Architectures.
Proceedings of the International Conference on Software Engineering Theory and Practice, 2008

Teaching Software Modeling and Design Based on The Science of Design and Science of Learning.
Proceedings of the 2008 International Conference on Frontiers in Education: Computer Science & Computer Engineering, 2008

EasyMAC: A New and Simple Protocol for Slot Assignment.
Proceedings of the ISCA 21st International Conference on Parallel and Distributed Computing and Communication Systems, 2008

Finding Shortest Multi-Paths with O(N2) Message Complexity.
Proceedings of the ISCA 21st International Conference on Parallel and Distributed Computing and Communication Systems, 2008

2007
Using data-integrity constraints in model-based design.
Proceedings of the 16th International Conference on Software Engineering and Data Engineering (SEDE-2007), 2007

A software tool for optimal class-hierarchy design based on the use-relationship among functions and variables.
Proceedings of the 16th International Conference on Software Engineering and Data Engineering (SEDE-2007), 2007

Reliable and Efficient Data Transfer in Wireless Sensor Networks via Out-of-Sequence Forwarding and Delayed Request for Missing Packets.
Proceedings of the Fourth International Conference on Information Technology: New Generations (ITNG 2007), 2007

Structuring Software Functional Requirements For Automated Design And Verification.
Proceedings of the 31st Annual International Computer Software and Applications Conference, 2007

2006
Conflating two polygonal lines.
Pattern Recognit., 2006

2005
Deadlock-Free Distributed Relaxed Mutual-Exclusion Without Revoke-Messages.
Proceedings of the Distributed Computing, 2005

A Formal Approach to Designing a Class-Subclass Structure Using a Partial-Order on the Functions.
Proceedings of the 29th Annual International Computer Software and Applications Conference, 2005

2004
A Modern Graphic Flowchart Layout Tool.
Proceedings of the Distributed Computing and Internet Technology, 2004

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

Modeling Complex Systems by A Set of Interacting Finite-State Models.
Proceedings of the 10th Asia-Pacific Software Engineering Conference (APSEC 2003), 2003

2002
Finite-State Modeling in Software Design: Some Fundamental Techniques.
Proceedings of the 9th Asia-Pacific Software Engineering Conference (APSEC 2002), 2002

2001
The normal form of a granular fuzzy function.
Fuzzy Sets Syst., 2001

The Canonical Functional Design Based on the Domination-Relationship among Data.
Proceedings of the 8th Asia-Pacific Software Engineering Conference (APSEC 2001), 2001

2000
Learning rules from numerical data by combining geometric and graph-theoretic approach.
Robotics Auton. Syst., 2000

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

An optimal O(N<sup>2</sup>) algorithm for computing the min-transitive closure of a weighted graph.
Inf. Process. Lett., 2000

A representation theorem for min-transitive fuzzy relations.
Fuzzy Sets Syst., 2000

Similarity relations, fuzzy linear orders, and fuzzy partial orders.
Fuzzy Sets Syst., 2000

The concept of path-closed subsets and its use in software functional design.
Proceedings of the 7th Asia-Pacific Software Engineering Conference (APSEC 2000), 2000

1999
Gravitational clustering: a new approach based on the spatial distribution of the points.
Pattern Recognit., 1999

Membership functions for a fuzzy group from similarity relations.
Fuzzy Sets Syst., 1999

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

Fuzzy logic or Lukasiewicz logic: A clarification.
Fuzzy Sets Syst., 1998

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

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

Preference relation on fuzzy utilities based on fuzzy leftness relation on intervals.
Fuzzy Sets Syst., 1998

1997
A New Method of Circumscribing Beliefs: The Propositional Case.
Fundam. Informaticae, 1997

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

1996
A new class of theories for which circumscription can be obtained via the predicate completion.
J. Exp. Theor. Artif. Intell., 1996

A Sound and Complete Fuzzy Logic System Using Zadeh's Implication Operator.
Proceedings of the Foundations of Intelligent Systems, 9th International Symposium, 1996

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

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

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

The Strong Semantics for Logic Programs.
Proceedings of the Methodologies for Intelligent Systems, 6th International Symposium, 1991

A New Logic of Beliefs: Monotonic and Non-Monotonic Beliefs - Part 1.
Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

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

A New and Simple Method for Explicit Computation of a Circumscription.
Proceedings of the GWAI-90, 1990

1988
The Equivalence of the Subregion Representation and the Wall Representation for a Certain Class of Rectangular Dissections.
Commun. ACM, 1988

A Correct Form of the Satisfiability-Graph Based Decision Algorithm for Linear Propositional Temporal Logic.
Proceedings of the Methodologies for Intelligent Systems, 1988

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

Rule-Discovery from Examples Using a Combination of Syntactic and Semantic Information.
Proceedings of the Methodologies for Intelligent Systems, 1987

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

Modeling the CODASYL DML context dependency for database program conversion.
Inf. Syst., 1986

Tree resolution and generalized semantic tree.
Proceedings of the ACM SIGART International Symposium on Methodologies for Intelligent Systems, 1986

1985
Analysis of the Context Dependency of CODASYL Find-Statements with Application to Database Program Conversion.
Proceedings of the 1985 ACM SIGMOD International Conference on Management of Data, 1985

An Improved Algorithm for Finding a Key of a Relation.
Proceedings of the Fourth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1985

1982
An O(V) algorithm M for computing transitive reduction of a planar acyclic digraph.
Proceedings of the 20th Annual Southeast Regional Conference, 1982

1980
Reconstruction of a Pair of Graphs from their Concatenations.
SIAM J. Algebraic Discret. Methods, 1980

1979
An Intermediate-Value Theorem for Optimum Tree Valuation.
Inf. Process. Lett., 1979

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

1977
A Linear Tree Partitioning Algorithm.
SIAM J. Comput., 1977

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

Sorting Tree, Nestling Tree and Inverse Permutation.
Inf. Process. Lett., 1977

1976
A Linear Algorithm for the Hamiltonian Completion Number of a Tree.
Inf. Process. Lett., 1976

1974
Existence of Graphs with Three Spanning Trees and Given Degree Sequence.
SIAM J. Comput., 1974

A factorization theorem for a certain class of graphs.
Discret. Math., 1974

Generalizations of the k-factor theorem.
Discret. Math., 1974

1973
A matroid generalization of a theorem of Mendelsohn and Dulmage.
Discret. Math., 1973

The k-factor conjecture is true.
Discret. Math., 1973


  Loading...